+IPv4 name resolution functions
+dns.toip
+and
+dns.tohostname
+return all information obtained from
+the resolver in a table of the form:
+
+
+
+resolved4 = {
+ name = canonic-name,
+ alias = alias-list,
+ ip = ip-address-list
+}
+
+
+
+Note that the alias list can be empty.
+
+
+
+The more general name resolution function
+dns.getaddrinfo, which
+supports both IPv6 and IPv4,
+returns all information obtained from
+the resolver in a table of the form:
+
+Here, family contains the string "inet" for IPv4
+addresses, and "inet6" for IPv6 addresses.
+
+
+
+
+
+socket.dns.getaddrinfo(address)
+
+
+
+Converts from host name to address.
+
+
+
+Address can be an IPv4 or IPv6 address or host name.
+
+
+
+The function returns a table with all information returned by
+the resolver. In case of error, the function returns nil
+followed by an error message.
+
+
+
+
+
+socket.dns.gethostname()
+
+
+
+Returns the standard host name for the machine as a string.
+
+
+
+
+
+socket.dns.tohostname(address)
+
+
+
+Converts from IPv4 address to host name.
+
+
+
+Address can be an IP address or host name.
+
+
+
+The function returns a string with the canonic host name of the given
+address, followed by a table with all information returned by
+the resolver. In case of error, the function returns nil
+followed by an error message.
+
+
+
+
+
+socket.dns.toip(address)
+
+
+
+Converts from host name to IPv4 address.
+
+
+
+Address can be an IP address or host name.
+
+
+
+Returns a string with the first IP address found for address,
+followed by a table with all information returned by the resolver.
+In case of error, the function returns nil followed by an error
+message.
+
+FTP (File Transfer Protocol) is a protocol used to transfer files
+between hosts. The ftp namespace offers thorough support
+to FTP, under a simple interface. The implementation conforms to
+RFC 959.
+
+
+
+High level functions are provided supporting the most common operations.
+These high level functions are implemented on top of a lower level
+interface. Using the low-level interface, users can easily create their
+own functions to access any operation supported by the FTP
+protocol. For that, check the implementation.
+
+The get function has two forms. The simple form has fixed
+functionality: it downloads the contents of a URL and returns it as a
+string. The generic form allows a lot more control, as explained
+below.
+
+
+
+If the argument of the get function is a table, the function
+expects at least the fields host, sink, and one of
+argument or path (argument takes
+precedence). Host is the server to connect to. Sink is
+the simple
+LTN12
+sink that will receive the downloaded data. Argument or
+path give the target path to the resource in the server. The
+optional arguments are the following:
+
+
+
user, password: User name and password used for
+authentication. Defaults to "ftp:anonymous@anonymous.org";
+
command: The FTP command used to obtain data. Defaults to
+"retr", but see example below;
+
port: The port to used for the control connection. Defaults to 21;
+
type: The transfer mode. Can take values "i" or
+"a". Defaults to whatever is the server default;
+
step:
+LTN12
+pump step function used to pass data from the
+server to the sink. Defaults to the LTN12 pump.step function;
+
create: An optional function to be used instead of
+socket.tcp when the communications socket is created.
+
+
+
+If successful, the simple version returns the URL contents as a
+string, and the generic function returns 1. In case of error, both
+functions return nil and an error message describing the
+error.
+
+
+
+-- load the ftp support
+local ftp = require("socket.ftp")
+
+-- Log as user "anonymous" on server "ftp.tecgraf.puc-rio.br",
+-- and get file "lua.tar.gz" from directory "pub/lua" as binary.
+f, e = ftp.get("ftp://ftp.tecgraf.puc-rio.br/pub/lua/lua.tar.gz;type=i")
+
+
+
+-- load needed modules
+local ftp = require("socket.ftp")
+local ltn12 = require("ltn12")
+local url = require("socket.url")
+
+-- a function that returns a directory listing
+function nlst(u)
+ local t = {}
+ local p = url.parse(u)
+ p.command = "nlst"
+ p.sink = ltn12.sink.table(t)
+ local r, e = ftp.get(p)
+ return r and table.concat(t), e
+end
+
+The put function has two forms. The simple form has fixed
+functionality: it uploads a string of content into a URL. The generic form
+allows a lot more control, as explained below.
+
+
+
+If the argument of the put function is a table, the function
+expects at least the fields host, source, and one of
+argument or path (argument takes
+precedence). Host is the server to connect to. Source is
+the simple
+LTN12
+source that will provide the contents to be uploaded.
+Argument or
+path give the target path to the resource in the server. The
+optional arguments are the following:
+
+
+
user, password: User name and password used for
+authentication. Defaults to "ftp:anonymous@anonymous.org";
+
command: The FTP command used to send data. Defaults to
+"stor", but see example below;
+
port: The port to used for the control connection. Defaults to 21;
+
type: The transfer mode. Can take values "i" or
+"a". Defaults to whatever is the server default;
+
step:
+LTN12
+pump step function used to pass data from the
+server to the sink. Defaults to the LTN12 pump.step function;
+
create: An optional function to be used instead of
+socket.tcp when the communications socket is created.
+
+
+
+Both functions return 1 if successful, or nil and an error
+message describing the reason for failure.
+
+
+
+-- load the ftp support
+local ftp = require("socket.ftp")
+
+-- Log as user "fulano" on server "ftp.example.com",
+-- using password "silva", and store a file "README" with contents
+-- "wrong password, of course"
+f, e = ftp.put("ftp://fulano:silva@ftp.example.com/README",
+ "wrong password, of course")
+
+
+
+-- load the ftp support
+local ftp = require("socket.ftp")
+local ltn12 = require("ltn12")
+
+-- Log as user "fulano" on server "ftp.example.com",
+-- using password "silva", and append to the remote file "LOG", sending the
+-- contents of the local file "LOCAL-LOG"
+f, e = ftp.put{
+ host = "ftp.example.com",
+ user = "fulano",
+ password = "silva",
+ command = "appe",
+ argument = "LOG",
+ source = ltn12.source.file(io.open("LOCAL-LOG", "r"))
+}
+
+HTTP (Hyper Text Transfer Protocol) is the protocol used to exchange
+information between web-browsers and servers. The http
+namespace offers full support for the client side of the HTTP
+protocol (i.e.,
+the facilities that would be used by a web-browser implementation). The
+implementation conforms to the HTTP/1.1 standard,
+RFC 2616.
+
+
+
+The module exports functions that provide HTTP functionality in different
+levels of abstraction. From the simple
+string oriented requests, through generic
+LTN12 based, down to even lower-level if you bother to look through the source code.
+
+
+
+To obtain the http namespace, run:
+
+
+
+-- loads the HTTP module and any libraries it requires
+local http = require("socket.http")
+
+
+
+URLs must conform to
+RFC 1738,
+that is, an URL is a string in the form:
+
+Field names are case insensitive (as specified by the standard) and all
+functions work with lowercase field names (but see
+socket.headers.canonic).
+Field values are left unmodified.
+
+
+
+Note: MIME headers are independent of order. Therefore, there is no problem
+in representing them in a Lua table.
+
+
+
+The following constants can be set to control the default behavior of
+the HTTP module:
+
+
+
+
PORT: default port used for connections;
+
PROXY: default proxy used for connections;
+
TIMEOUT: sets the timeout for all I/O operations;
+
USERAGENT: default user agent reported to server.
+
+The request function has two forms. The simple form downloads
+a URL using the GET or POST method and is based
+on strings. The generic form performs any HTTP method and is
+LTN12 based.
+
+
+
+If the first argument of the request function is a string, it
+should be an url. In that case, if a body
+is provided as a string, the function will perform a POST method
+in the url. Otherwise, it performs a GET in the
+url
+
+
+
+If the first argument is instead a table, the most important fields are
+the url and the simple
+LTN12
+sink that will receive the downloaded content.
+Any part of the url can be overridden by including
+the appropriate field in the request table.
+If authentication information is provided, the function
+uses the Basic Authentication Scheme (see note)
+to retrieve the document. If sink is nil, the
+function discards the downloaded data. The optional parameters are the
+following:
+
+
+
method: The HTTP request method. Defaults to "GET";
+
headers: Any additional HTTP headers to send with the request;
+
source: simple
+LTN12
+source to provide the request body. If there
+is a body, you need to provide an appropriate "content-length"
+request header field, or the function will attempt to send the body as
+"chunked" (something few servers support). Defaults to the empty source;
+
step:
+LTN12
+pump step function used to move data.
+Defaults to the LTN12 pump.step function.
+
proxy: The URL of a proxy server to use. Defaults to no proxy;
+
redirect: Set to false to prevent the
+function from automatically following 301 or 302 server redirect messages;
+
create: An optional function to be used instead of
+socket.tcp when the communications socket is created.
+
+
+
+In case of failure, the function returns nil followed by an
+error message. If successful, the simple form returns the response
+body as a string, followed by the response status code, the response
+headers and the response status line. The generic function returns the same
+information, except the first return value is just the number 1 (the body
+goes to the sink).
+
+
+
+Even when the server fails to provide the contents of the requested URL (URL not found, for example),
+it usually returns a message body (a web page informing the
+URL was not found or some other useless page). To make sure the
+operation was successful, check the returned status code. For
+a list of the possible values and their meanings, refer to RFC 2616.
+
+
+
+Here are a few examples with the simple interface:
+
+
+
+-- load the http module
+local io = require("io")
+local http = require("socket.http")
+local ltn12 = require("ltn12")
+
+-- connect to server "www.cs.princeton.edu" and retrieves this manual
+-- file from "~diego/professional/luasocket/http.html" and print it to stdout
+http.request{
+ url = "http://www.cs.princeton.edu/~diego/professional/luasocket/http.html",
+ sink = ltn12.sink.file(io.stdout)
+}
+
+-- connect to server "www.example.com" and tries to retrieve
+-- "/private/index.html". Fails because authentication is needed.
+b, c, h = http.request("http://www.example.com/private/index.html")
+-- b returns some useless page telling about the denied access,
+-- h returns authentication information
+-- and c returns with value 401 (Authentication Required)
+
+-- tries to connect to server "wrong.host" to retrieve "/"
+-- and fails because the host does not exist.
+r, e = http.request("http://wrong.host/")
+-- r is nil, and e returns with value "host not found"
+
+
+
+And here is an example using the generic interface:
+
+
+
+-- load the http module
+http = require("socket.http")
+
+-- Requests information about a document, without downloading it.
+-- Useful, for example, if you want to display a download gauge and need
+-- to know the size of the document in advance
+r, c, h = http.request {
+ method = "HEAD",
+ url = "http://www.tecgraf.puc-rio.br/~diego"
+}
+-- r is 1, c is 200, and h would return the following headers:
+-- h = {
+-- date = "Tue, 18 Sep 2001 20:42:21 GMT",
+-- server = "Apache/1.3.12 (Unix) (Red Hat/Linux)",
+-- ["last-modified"] = "Wed, 05 Sep 2001 06:11:20 GMT",
+-- ["content-length"] = 15652,
+-- ["connection"] = "close",
+-- ["content-Type"] = "text/html"
+-- }
+
+
+
+Note: When sending a POST request, simple interface adds a
+"Content-type: application/x-www-form-urlencoded"
+header to the request. This is the type used by
+HTML forms. If you need another type, use the generic
+interface.
+
+
+
+Note: Some URLs are protected by their
+servers from anonymous download. For those URLs, the server must receive
+some sort of authentication along with the request or it will deny
+download and return status "401 Authentication Required".
+
+
+
+The HTTP/1.1 standard defines two authentication methods: the Basic
+Authentication Scheme and the Digest Authentication Scheme, both
+explained in detail in
+RFC 2068.
+
+
+
The Basic Authentication Scheme sends
+<user> and
+<password> unencrypted to the server and is therefore
+considered unsafe. Unfortunately, by the time of this implementation,
+the wide majority of servers and browsers support the Basic Scheme only.
+Therefore, this is the method used by the toolkit whenever
+authentication is required.
+
+
+
+-- load required modules
+http = require("socket.http")
+mime = require("mime")
+
+-- Connect to server "www.example.com" and tries to retrieve
+-- "/private/index.html", using the provided name and password to
+-- authenticate the request
+b, c, h = http.request("http://fulano:silva@www.example.com/private/index.html")
+
+-- Alternatively, one could fill the appropriate header and authenticate
+-- the request directly.
+r, c = http.request {
+ url = "http://www.example.com/private/index.html",
+ headers = { authorization = "Basic " .. (mime.b64("fulano:silva")) }
+}
+
+
+
+
+
+
+
+
diff --git a/doc/index.html b/doc/index.html
new file mode 100644
index 0000000..d8ee4a4
--- /dev/null
+++ b/doc/index.html
@@ -0,0 +1,186 @@
+
+
+
+
+
+
+LuaSocket: Network support for the Lua language
+
+
+
+
+
+
+
+
+LuaSocket is a Lua extension library
+that is composed by two parts: a C core that provides support for the TCP
+and UDP transport layers, and a set of Lua modules that add support for
+functionality commonly needed by applications that deal with the Internet.
+
+
+
+The core support has been implemented so that it is both efficient and
+simple to use. It is available to any Lua application once it has been
+properly initialized by the interpreter in use. The code has been tested
+and runs well on several Windows and Unix platforms.
+
+
+Among the support modules, the most commonly used implement the
+SMTP
+(sending e-mails),
+HTTP
+(WWW access) and
+FTP
+(uploading and downloading files) client
+protocols. These provide a very natural and generic interface to the
+functionality defined by each protocol.
+In addition, you will find that the
+MIME (common encodings),
+URL
+(anything you could possible want to do with one) and
+LTN12
+(filters, sinks, sources and pumps) modules can be very handy.
+
+
+
+The library is available under the same
+
+terms and conditions as the Lua language, the MIT license. The idea is
+that if you can use Lua in a project, you should also be able to use
+LuaSocket.
+
+LuaSocket version 2.1-rc1 is now available for download!
+It is compatible with Lua 5.1 and 5.2, and has
+been tested on Windows XP, Linux, and Mac OS X. Chances
+are it works well on most UNIX distributions and Windows flavors.
+
+
+
+The library can be downloaded in source code from the
+LuaSocket
+project page at GitHub. Besides the full C and Lua source code
+for the library, the distribution contains several examples,
+this user's manual and basic test procedures.
+
+
+
Take a look at the installation section of the
+manual to find out how to properly install the library.
+
+
+
+
+
Special thanks
+
+
+This marks the first release of LuaSocket that
+wholeheartedly embraces the open-source development
+philosophy. After a long hiatus, Matthew Wild finally
+convinced me it was time for a release including IPv6
+and Lua 5.2 support. Special thanks to Sam Roberts, Florian
+Zeitz, and Paul Aurich, Liam Devine, and everybody else that
+has helped bring this library back to life.
+
+
+
+
+
What's New
+
+
+Main changes for LuaSocket 2.1-rc1 are IPv6 support
+and Lua 5.2 compatibility.
+
+
+
+
Added: Compatible with Lua 5.2 (using LUA_COMPAT_MODULE);
+
Added: IPv6 support;
+
+
Socket.connect and socket.bind support IPv6 addresses;
+
Getpeername and getsockname support
+IPv6 addresses, and return the socket family as a third value;
+
URL module updated to support IPv6 host names;
+
New socket.tcp6 and socket.udp6 functions;
+
New socket.dns.getaddrinfo function;
+
+
Added: getoption method;
+
Fixed: url.unescape was returning additional values;
+
Fixed: mime.qp, mime.unqp,
+ mime.b64, and mime.unb64 could
+ mistaking their own stack slots for functions arguments;
+
Fixed: Receiving zero-length datagram is now possible;
+
Improved: Hidden all internal library symbols;
+
Improved: Better error messages;
+
Improved: Better documentation of socket options.
+
+
+
+
+
Old Versions
+
+
+All previous versions of the LuaSocket library can be downloaded
+here. Although these versions are no longer supported, they are
+still available for those that have compatibility issues.
+
LuaSocket 2.1-rc still uses Lua 5.1's package
+system. Users that have already made the switch to
+Lua 5.2 should leave the default
+LUA_COMPAT_MODULE defined when compiling their Lua
+distribution for compatibility with LuaSocket.
+
+
Here we describe the standard distribution. If the
+standard doesn't meet your needs, we refer you to the Lua
+discussion list, where any question about the package scheme
+will likely already have been answered.
+
+
Directory structure
+
+
On Unix systems, the standard distribution uses two base
+directories, one for system dependent files, and another for system
+independent files. Let's call these directories <CDIR>
+and <LDIR>, respectively.
+For example, in my laptp, Lua 5.1 is configured to
+use '/usr/local/lib/lua/5.1' for
+<CDIR> and '/usr/local/share/lua/5.1' for
+<LDIR>. On Windows, <CDIR>
+usually points to the directory where the Lua executable is
+found, and <LDIR> points to a
+lua/ directory inside <CDIR>. (These
+settings can be overridden by environment variables
+LUA_PATH and LUA_CPATH. See the Lua
+documentation for details.) Here is the standard LuaSocket
+distribution directory structure:
Naturally, on Unix systems, core.dll
+would be replaced by core.so.
+
+
+
Using LuaSocket
+
+
With the above setup, and an interpreter with shared library support,
+it should be easy to use LuaSocket. Just fire the interpreter and use the
+require function to gain access to whatever module you need:
+LuaSocket is a Lua extension library
+that is composed by two parts: a C core that provides support for the TCP
+and UDP transport layers, and a set of Lua modules that add support for
+the SMTP (sending e-mails), HTTP (WWW access) and FTP (uploading and
+downloading files) protocols and other functionality commonly needed by
+applications that deal with the Internet. This introduction is about the C
+core.
+
+
+
+Communication in LuaSocket is performed via I/O objects. These can
+represent different network domains. Currently, support is provided for TCP
+and UDP, but nothing prevents other developers from implementing SSL, Local
+Domain, Pipes, File Descriptors etc. I/O objects provide a standard
+interface to I/O across different domains and operating systems.
+
+
+
+The API design had two goals in mind. First, users
+experienced with the C API to sockets should feel comfortable using LuaSocket.
+Second, the simplicity and the feel of the Lua language should be
+preserved. To achieve these goals, the LuaSocket API keeps the function names and semantics the C API whenever possible, but their usage in Lua has been greatly simplified.
+
+
+
+
+One of the simplifications is the receive pattern capability.
+Applications can read data from stream domains (such as TCP)
+line by line, block by block, or until the connection is closed.
+All I/O reads are buffered and the performance differences between
+different receive patterns are negligible.
+
+
+
+Another advantage is the flexible timeout control
+mechanism. As in C, all I/O operations are blocking by default. For
+example, the send,
+receive and
+accept methods
+of the TCP domain will block the caller application until
+the operation is completed (if ever!). However, with a call to the
+settimeout
+method, an application can specify upper limits on
+the time it can be blocked by LuaSocket (the "total" timeout), on
+the time LuaSocket can internally be blocked by any OS call (the
+"block" timeout) or a combination of the two. Each LuaSocket
+call might perform several OS calls, so that the two timeout values are
+not equivalent.
+
+
+
+Finally, the host name resolution is transparent, meaning that most
+functions and methods accept both IP addresses and host names. In case a
+host name is given, the library queries the system's resolver and
+tries the main IP address returned. Note that direct use of IP addresses
+is more efficient, of course. The
+toip
+and tohostname
+functions from the DNS module are provided to convert between host names and IP addresses.
+
+
+
+Together, these changes make network programming in LuaSocket much simpler
+than it is in C, as the following sections will show.
+
+
+
+
+
TCP
+
+
+TCP (Transfer Control Protocol) is reliable stream protocol. In other
+words, applications communicating through TCP can send and receive data as
+an error free stream of bytes. Data is split in one end and
+reassembled transparently on the other end. There are no boundaries in
+the data transfers. The library allows users to read data from the
+sockets in several different granularities: patterns are available for
+lines, arbitrary sized blocks or "read up to connection closed", all with
+good performance.
+
+
+
+The library distinguishes three types of TCP sockets: master,
+client and server sockets.
+
+
+
+Master sockets are newly created TCP sockets returned by the function
+socket.tcp. A master socket is
+transformed into a server socket
+after it is associated with a local address by a call to the
+bind method followed by a call to the
+listen. Conversely, a master socket
+can be changed into a client socket with the method
+connect,
+which associates it with a remote address.
+
+
+
+On server sockets, applications can use the
+accept method
+to wait for a client connection. Once a connection is established, a
+client socket object is returned representing this connection. The
+other methods available for server socket objects are
+getsockname,
+setoption,
+settimeout, and
+close.
+
+
+
+Client sockets are used to exchange data between two applications over
+the Internet. Applications can call the methods
+send and
+receive
+to send and receive data. The other methods
+available for client socket objects are
+getsockname,
+getpeername,
+setoption,
+settimeout,
+shutdown, and
+close.
+
+
+
+Example:
+
+
+
+A simple echo server, using LuaSocket. The program binds to an ephemeral
+port (one that is chosen by the operating system) on the local host and
+awaits client connections on that port. When a connection is established,
+the program reads a line from the remote end and sends it back, closing
+the connection immediately. You can test it using the telnet
+program.
+
+
+
+-- load namespace
+local socket = require("socket")
+-- create a TCP socket and bind it to the local host, at any port
+local server = assert(socket.bind("*", 0))
+-- find out which port the OS chose for us
+local ip, port = server:getsockname()
+-- print a message informing what's up
+print("Please telnet to localhost on port " .. port)
+print("After connecting, you have 10s to enter a line to be echoed")
+-- loop forever waiting for clients
+while 1 do
+ -- wait for a connection from any client
+ local client = server:accept()
+ -- make sure we don't block waiting for this client's line
+ client:settimeout(10)
+ -- receive the line
+ local line, err = client:receive()
+ -- if there was no error, send it back to the client
+ if not err then client:send(line .. "\n") end
+ -- done with client, close the object
+ client:close()
+end
+
+
+
+
+
+
UDP
+
+
+UDP (User Datagram Protocol) is a non-reliable datagram protocol. In
+other words, applications communicating through UDP send and receive
+data as independent blocks, which are not guaranteed to reach the other
+end. Even when they do reach the other end, they are not guaranteed to be
+error free. Data transfers are atomic, one datagram at a time. Reading
+only part of a datagram discards the rest, so that the following read
+operation will act on the next datagram. The advantages are in
+simplicity (no connection setup) and performance (no error checking or
+error correction).
+
+
+
+Note that although no guarantees are made, these days
+networks are so good that, under normal circumstances, few errors
+happen in practice.
+
+
+
+An UDP socket object is created by the
+socket.udp function. UDP
+sockets do not need to be connected before use. The method
+sendto
+can be used immediately after creation to
+send a datagram to IP address and port. Host names are not allowed
+because performing name resolution for each packet would be forbiddingly
+slow. Methods
+receive and
+receivefrom
+can be used to retrieve datagrams, the latter returning the IP and port of
+the sender as extra return values (thus being slightly less
+efficient).
+
+
+
+When communication is performed repeatedly with a single peer, an
+application should call the
+setpeername method to specify a
+permanent partner. Methods
+sendto and
+receivefrom
+can no longer be used, but the method
+send can be used to send data
+directly to the peer, and the method
+receive
+will only return datagrams originating
+from that peer. There is about 30% performance gain due to this practice.
+
+
+
+To associate an UDP socket with a local address, an application calls the
+setsockname
+method before sending any datagrams. Otherwise, the socket is
+automatically bound to an ephemeral address before the first data
+transmission and once bound the local address cannot be changed.
+The other methods available for UDP sockets are
+getpeername,
+getsockname,
+settimeout,
+setoption and
+close.
+
+
+
+Example:
+
+
+
+A simple daytime client, using LuaSocket. The program connects to a remote
+server and tries to retrieve the daytime, printing the answer it got or an
+error message.
+
+
+
+-- change here to the host an port you want to contact
+local host, port = "localhost", 13
+-- load namespace
+local socket = require("socket")
+-- convert host name to ip address
+local ip = assert(socket.dns.toip(host))
+-- create a new UDP object
+local udp = assert(socket.udp())
+-- contact daytime host
+assert(udp:sendto("anything", ip, port))
+-- retrieve the answer and print results
+io.write(assert(udp:receive()))
+
+
+
+
+
+
Support modules
+
+
Although not covered in the introduction, LuaSocket offers
+much more than TCP and UDP functionality. As the library
+evolved, support for HTTP, FTP,
+and SMTP were built on top of these. These modules
+and many others are covered by the reference manual.
+
The ltn12 namespace implements the ideas described in
+
+LTN012, Filters sources and sinks. This manual simply describes the
+functions. Please refer to the LTN for a deeper explanation of the
+functionality provided by this module.
+
+
+
+To obtain the ltn12 namespace, run:
+
+
+
+-- loads the LTN21 module
+local ltn12 = require("ltn12")
+
+Returns a filter that passes all data it receives through each of a
+series of given filters.
+
+
+
+Filter1 to filterN are simple
+filters.
+
+
+
+The function returns the chained filter.
+
+
+
+The nesting of filters can be arbitrary. For instance, the useless filter
+below doesn't do anything but return the data that was passed to it,
+unaltered.
+
+If successful, the function returns a value that evaluates to
+true. In case
+of error, the function returns a false value, followed by an error message.
+
+
+
+
+
+ltn12.pump.step(source, sink)
+
+
+
+Pumps one chunk of data from a source to a sink.
+
+
+
+If successful, the function returns a value that evaluates to
+true. In case
+of error, the function returns a false value, followed by an error message.
+
+
+
+
+
Sinks
+
+
+
+
+ltn12.sink.chain(filter, sink)
+
+
+
+Creates and returns a new sink that passes data through a filter before sending it to a given sink.
+
+
+
+
+
+ltn12.sink.error(message)
+
+
+
+Creates and returns a sink that aborts transmission with the error
+message.
+
+
+
+
+
+ltn12.sink.file(handle, message)
+
+
+
+Creates a sink that sends data to a file.
+
+
+
+Handle is a file handle. If handle is nil,
+message should give the reason for failure.
+
+
+
+The function returns a sink that sends all data to the given handle
+and closes the file when done, or a sink that aborts the transmission with
+the error message
+
+
+
+In the following example, notice how the prototype is designed to
+fit nicely with the io.open function.
+
+Creates a new source that produces the concatenation of the data produced
+by a number of sources.
+
+
+
+Source1 to sourceN are the original
+sources.
+
+
+
+The function returns the new source.
+
+
+
+
+
+ltn12.source.chain(source, filter)
+
+
+
+Creates a new source that passes data through a filter
+before returning it.
+
+
+
+The function returns the new source.
+
+
+
+
+
+ltn12.source.empty()
+
+
+
+Creates and returns an empty source.
+
+
+
+
+
+ltn12.source.error(message)
+
+
+
+Creates and returns a source that aborts transmission with the error
+message.
+
+
+
+
+
+ltn12.source.file(handle, message)
+
+
+
+Creates a source that produces the contents of a file.
+
+
+
+Handle is a file handle. If handle is nil,
+message should give the reason for failure.
+
+
+
+The function returns a source that reads chunks of data from
+given handle and returns it to the user,
+closing the file when done, or a source that aborts the transmission with
+the error message
+
+
+
+In the following example, notice how the prototype is designed to
+fit nicely with the io.open function.
+
+The mime namespace offers filters that apply and remove common
+content transfer encodings, such as Base64 and Quoted-Printable.
+It also provides functions to break text into lines and change
+the end-of-line convention.
+MIME is described mainly in
+RFC 2045,
+2046,
+2047,
+2048, and
+2049.
+
+-- loads the MIME module and everything it requires
+local mime = require("mime")
+
+
+
+
+
+
High-level filters
+
+
+
+
+mime.normalize([marker])
+
+
+
+Converts most common end-of-line markers to a specific given marker.
+
+
+
+Marker is the new marker. It defaults to CRLF, the canonic
+end-of-line marker defined by the MIME standard.
+
+
+
+The function returns a filter that performs the conversion.
+
+
+
+Note: There is no perfect solution to this problem. Different end-of-line
+markers are an evil that will probably plague developers forever.
+This function, however, will work perfectly for text created with any of
+the most common end-of-line markers, i.e. the Mac OS (CR), the Unix (LF),
+or the DOS (CRLF) conventions. Even if the data has mixed end-of-line
+markers, the function will still work well, although it doesn't
+guarantee that the number of empty lines will be correct.
+
+Returns a filter that encodes data according to a given transfer content
+encoding.
+
+
+
+In the Quoted-Printable case, the user can specify whether the data is
+textual or binary, by passing the mode strings "text" or
+"binary". Mode defaults to "text".
+
+
+
+Although both transfer content encodings specify a limit for the line
+length, the encoding filters do not break text into lines (for
+added flexibility).
+Below is a filter that converts binary data to the Base64 transfer content
+encoding and breaks it into lines of the correct size.
+
+The "text" line-wrap filter simply breaks text into lines by
+inserting CRLF end-of-line markers at appropriate positions.
+Length defaults 76.
+The "base64" line-wrap filter works just like the default
+"text" line-wrap filter with default length.
+The function can also wrap "quoted-printable" lines, taking care
+not to break lines in the middle of an escaped character. In that case, the
+line length is fixed at 76.
+
+
+
+For example, to create an encoding filter for the Quoted-Printable transfer content encoding of text data, do the following:
+
+Note: To break into lines with a different end-of-line convention, apply
+a normalization filter after the line break filter.
+
+
+
+
+
Low-level filters
+
+
+
+
+A, B = mime.b64(C [, D])
+
+
+
+Low-level filter to perform Base64 encoding.
+
+
+
+A is the encoded version of the largest prefix of
+C..D
+that can be encoded unambiguously. B has the remaining bytes of
+C..D, before encoding.
+If D is nil, A is padded with
+the encoding of the remaining bytes of C.
+
+
+
+Note: The simplest use of this function is to encode a string into it's
+Base64 transfer content encoding. Notice the extra parenthesis around the
+call to mime.b64, to discard the second return value.
+
+Low-level filter to perform SMTP stuffing and enable transmission of
+messages containing the sequence "CRLF.CRLF".
+
+
+
+A is the stuffed version of B. 'n' gives the
+number of characters from the sequence CRLF seen in the end of B.
+'m' should tell the same, but for the previous chunk.
+
+
+
Note: The message body is defined to begin with
+an implicit CRLF. Therefore, to stuff a message correctly, the
+first m should have the value 2.
+
+
+
+print((string.gsub(mime.dot(2, ".\r\nStuffing the message.\r\n.\r\n."), "\r\n", "\\n")))
+--> ..\nStuffing the message.\n..\n..
+
+
+
+Note: The smtp.send function
+uses this filter automatically. You don't need to
+apply it again.
+
+
+
+
+
+A, B = mime.eol(C [, D, marker])
+
+
+
+Low-level filter to perform end-of-line marker translation.
+For each chunk, the function needs to know if the last character of the
+previous chunk could be part of an end-of-line marker or not. This is the
+context the function receives besides the chunk. An updated version of
+the context is returned after each new chunk.
+
+
+
+A is the translated version of D. C is the
+ASCII value of the last character of the previous chunk, if it was a
+candidate for line break, or 0 otherwise.
+B is the same as C, but for the current
+chunk. Marker gives the new end-of-line marker and defaults to CRLF.
+
+
+
+-- translates the end-of-line marker to UNIX
+unix = mime.eol(0, dos, "\n")
+
+
+
+
+
+A, B = mime.qp(C [, D, marker])
+
+
+
+Low-level filter to perform Quoted-Printable encoding.
+
+
+
+A is the encoded version of the largest prefix of
+C..D
+that can be encoded unambiguously. B has the remaining bytes of
+C..D, before encoding.
+If D is nil, A is padded with
+the encoding of the remaining bytes of C.
+Throughout encoding, occurrences of CRLF are replaced by the
+marker, which itself defaults to CRLF.
+
+
+
+Note: The simplest use of this function is to encode a string into it's
+Quoted-Printable transfer content encoding.
+Notice the extra parenthesis around the call to mime.qp, to discard the second return value.
+
+
+
+print((mime.qp("maçã")))
+--> ma=E7=E3=
+
+
+
+
+
+A, m = mime.qpwrp(n [, B, length])
+
+
+
+Low-level filter to break Quoted-Printable text into lines.
+
+
+
+A is a copy of B, broken into lines of at most
+length bytes (defaults to 76).
+'n' should tell how many bytes are left for the first
+line of B and 'm' returns the number of bytes
+left in the last line of A.
+
+
+
+Note: Besides breaking text into lines, this function makes sure the line
+breaks don't fall in the middle of an escaped character combination. Also,
+this function only breaks lines that are bigger than length bytes.
+
+
+
+
+
+A, B = mime.unb64(C [, D])
+
+
+
+Low-level filter to perform Base64 decoding.
+
+
+
+A is the decoded version of the largest prefix of
+C..D
+that can be decoded unambiguously. B has the remaining bytes of
+C..D, before decoding.
+If D is nil, A is the empty string
+and B returns whatever couldn't be decoded.
+
+
+
+Note: The simplest use of this function is to decode a string from it's
+Base64 transfer content encoding.
+Notice the extra parenthesis around the call to mime.unqp, to discard the second return value.
+
+Low-level filter to remove the Quoted-Printable transfer content encoding
+from data.
+
+
+
+A is the decoded version of the largest prefix of
+C..D
+that can be decoded unambiguously. B has the remaining bytes of
+C..D, before decoding.
+If D is nil, A is augmented with
+the encoding of the remaining bytes of C.
+
+
+
+Note: The simplest use of this function is to decode a string from it's
+Quoted-Printable transfer content encoding.
+Notice the extra parenthesis around the call to mime.unqp, to discard the second return value.
+
+
+
+print((mime.qp("ma=E7=E3=")))
+--> maçã
+
+
+
+
+
+A, m = mime.wrp(n [, B, length])
+
+
+
+Low-level filter to break text into lines with CRLF marker.
+Text is assumed to be in the normalize form.
+
+
+
+A is a copy of B, broken into lines of at most
+length bytes (defaults to 76).
+'n' should tell how many bytes are left for the first
+line of B and 'm' returns the number of bytes
+left in the last line of A.
+
+
+
+Note: This function only breaks lines that are bigger than
+length bytes. The resulting line length does not include the CRLF
+marker.
+
The smtp namespace provides functionality to send e-mail
+messages. The high-level API consists of two functions: one to
+define an e-mail message, and another to actually send the message.
+Although almost all users will find that these functions provide more than
+enough functionality, the underlying implementation allows for even more
+control (if you bother to read the code).
+
+
+
The implementation conforms to the Simple Mail Transfer Protocol,
+RFC 2821.
+Another RFC of interest is RFC 2822,
+which governs the Internet Message Format.
+Multipart messages (those that contain attachments) are part
+of the MIME standard, but described mainly
+in RFC 2046
+
+
In the description below, good understanding of LTN012, Filters
+sources and sinks and the MIME module is
+assumed. In fact, the SMTP module was the main reason for their
+creation.
+
+
+To obtain the smtp namespace, run:
+
+
+
+-- loads the SMTP module and everything it requires
+local smtp = require("socket.smtp")
+
+
+
+MIME headers are represented as a Lua table in the form:
+
+Field names are case insensitive (as specified by the standard) and all
+functions work with lowercase field names (but see
+socket.headers.canonic).
+Field values are left unmodified.
+
+
+
+Note: MIME headers are independent of order. Therefore, there is no problem
+in representing them in a Lua table.
+
+
+
+The following constants can be set to control the default behavior of
+the SMTP module:
+
+
+
+
DOMAIN: domain used to greet the server;
+
PORT: default port used for the connection;
+
SERVER: default server used for the connection;
+
TIMEOUT: default timeout for all I/O operations;
+
+Sends a message to a recipient list. Since sending messages is not as
+simple as downloading an URL from a FTP or HTTP server, this function
+doesn't have a simple interface. However, see the
+message source factory for
+a very powerful way to define the message contents.
+
+
+
+
+The sender is given by the e-mail address in the from field.
+Rcpt is a Lua table with one entry for each recipient e-mail
+address, or a string
+in case there is just one recipient.
+The contents of the message are given by a simple
+LTN12
+source. Several arguments are optional:
+
+
+
user, password: User and password for
+authentication. The function will attempt LOGIN and PLAIN authentication
+methods if supported by the server (both are unsafe);
+
server: Server to connect to. Defaults to "localhost";
+
port: Port to connect to. Defaults to 25;
+
domain: Domain name used to greet the server; Defaults to the
+local machine host name;
+
step:
+LTN12
+pump step function used to pass data from the
+source to the server. Defaults to the LTN12 pump.step function;
+
create: An optional function to be used instead of
+socket.tcp when the communications socket is created.
+
+
+
+If successful, the function returns 1. Otherwise, the function returns
+nil followed by an error message.
+
+
+
+Note: SMTP servers can be very picky with the format of e-mail
+addresses. To be safe, use only addresses of the form
+"<fulano@example.com>" in the from and
+rcpt arguments to the send function. In headers, e-mail
+addresses can take whatever form you like.
+
+
+Big note: There is a good deal of misconception with the use of the
+destination address field headers, i.e., the 'To', 'Cc',
+and, more importantly, the 'Bcc' headers. Do not add a
+'Bcc' header to your messages because it will probably do the
+exact opposite of what you expect.
+
+
+
+Only recipients specified in the rcpt list will receive a copy of the
+message. Each recipient of an SMTP mail message receives a copy of the
+message body along with the headers, and nothing more. The headers
+are part of the message and should be produced by the
+LTN12
+source function. The rcpt list is not
+part of the message and will not be sent to anyone.
+
+
+
+RFC 2822
+has two important and short sections, "3.6.3. Destination address
+fields" and "5. Security considerations", explaining the proper
+use of these headers. Here is a summary of what it says:
+
+
+
+
To: contains the address(es) of the primary recipient(s)
+of the message;
+
Cc: (where the "Cc" means "Carbon Copy" in the sense of
+making a copy on a typewriter using carbon paper) contains the
+addresses of others who are to receive the message, though the
+content of the message may not be directed at them;
+
Bcc: (where the "Bcc" means "Blind Carbon
+Copy") contains addresses of recipients of the message whose addresses are not to be revealed to other recipients of the message.
+
+
+
+The LuaSocket send function does not care or interpret the
+headers you send, but it gives you full control over what is sent and
+to whom it is sent:
+
+
+
If someone is to receive the message, the e-mail address has
+to be in the recipient list. This is the only parameter that controls who
+gets a copy of the message;
+
If there are multiple recipients, none of them will automatically
+know that someone else got that message. That is, the default behavior is
+similar to the Bcc field of popular e-mail clients;
+
It is up to you to add the To header with the list of primary
+recipients so that other recipients can see it;
+
It is also up to you to add the Cc header with the
+list of additional recipients so that everyone else sees it;
+
Adding a header Bcc is nonsense, unless it is
+empty. Otherwise, everyone receiving the message will see it and that is
+exactly what you don't want to happen!
+
+
+
+I hope this clarifies the issue. Otherwise, please refer to
+RFC 2821
+and
+RFC 2822.
+
+
+
+-- load the smtp support
+local smtp = require("socket.smtp")
+
+-- Connects to server "localhost" and sends a message to users
+-- "fulano@example.com", "beltrano@example.com",
+-- and "sicrano@example.com".
+-- Note that "fulano" is the primary recipient, "beltrano" receives a
+-- carbon copy and neither of them knows that "sicrano" received a blind
+-- carbon copy of the message.
+from = "<luasocket@example.com>"
+
+rcpt = {
+ "<fulano@example.com>",
+ "<beltrano@example.com>",
+ "<sicrano@example.com>"
+}
+
+mesgt = {
+ headers = {
+ to = "Fulano da Silva <fulano@example.com>",
+ cc = '"Beltrano F. Nunes" <beltrano@example.com>',
+ subject = "My first message"
+ },
+ body = "I hope this works. If it does, I can send you another 1000 copies."
+}
+
+r, e = smtp.send{
+ from = from,
+ rcpt = rcpt,
+ source = smtp.message(mesgt)
+}
+
+
+
+
+
+smtp.message(mesgt)
+
+
+
+Returns a simple
+LTN12 source that sends an SMTP message body, possibly multipart (arbitrarily deep).
+
+
+
+The only parameter of the function is a table describing the message.
+Mesgt has the following form (notice the recursive structure):
+
+For a simple message, all that is needed is a set of headers
+and the body. The message body can be given as a string
+or as a simple
+LTN12
+source. For multipart messages, the body is a table that
+recursively defines each part as an independent message, plus an optional
+preamble and epilogue.
+
+
+
+The function returns a simple
+LTN12
+source that produces the
+message contents as defined by mesgt, chunk by chunk.
+Hopefully, the following
+example will make things clear. When in doubt, refer to the appropriate RFC
+as listed in the introduction.
+
+
+-- load the smtp support and its friends
+local smtp = require("socket.smtp")
+local mime = require("mime")
+local ltn12 = require("ltn12")
+
+-- creates a source to send a message with two parts. The first part is
+-- plain text, the second part is a PNG image, encoded as base64.
+source = smtp.message{
+ headers = {
+ -- Remember that headers are *ignored* by smtp.send.
+ from = "Sicrano de Oliveira <sicrano@example.com>",
+ to = "Fulano da Silva <fulano@example.com>",
+ subject = "Here is a message with attachments"
+ },
+ body = {
+ preamble = "If your client doesn't understand attachments, \r\n" ..
+ "it will still display the preamble and the epilogue.\r\n" ..
+ "Preamble will probably appear even in a MIME enabled client.",
+ -- first part: no headers means plain text, us-ascii.
+ -- The mime.eol low-level filter normalizes end-of-line markers.
+ [1] = {
+ body = mime.eol(0, [[
+ Lines in a message body should always end with CRLF.
+ The smtp module will *NOT* perform translation. However, the
+ send function *DOES* perform SMTP stuffing, whereas the message
+ function does *NOT*.
+ ]])
+ },
+ -- second part: headers describe content to be a png image,
+ -- sent under the base64 transfer content encoding.
+ -- notice that nothing happens until the message is actually sent.
+ -- small chunks are loaded into memory right before transmission and
+ -- translation happens on the fly.
+ [2] = {
+ headers = {
+ ["content-type"] = 'image/png; name="image.png"',
+ ["content-disposition"] = 'attachment; filename="image.png"',
+ ["content-description"] = 'a beautiful image',
+ ["content-transfer-encoding"] = "BASE64"
+ },
+ body = ltn12.source.chain(
+ ltn12.source.file(io.open("image.png", "rb")),
+ ltn12.filter.chain(
+ mime.encode("base64"),
+ mime.wrap()
+ )
+ )
+ },
+ epilogue = "This might also show up, but after the attachments"
+ }
+}
+
+-- finally send it
+r, e = smtp.send{
+ from = "<sicrano@example.com>",
+ rcpt = "<fulano@example.com>",
+ source = source,
+}
+
+The socket namespace contains the core functionality of LuaSocket.
+
+
+
+To obtain the socket namespace, run:
+
+
+
+-- loads the socket module
+local socket = require("socket")
+
+
+
+
+
+socket.bind(address, port [, backlog])
+
+
+
+This function is a shortcut that creates and returns a TCP server object
+bound to a local address and port, ready to
+accept client connections. Optionally,
+user can also specify the backlog argument to the
+listen method (defaults to 32).
+
+
+
+Note: The server object returned will have the option "reuseaddr"
+set to true.
+
+
+
+
+
+socket.connect[46](address, port [, locaddr] [, locport] [, family])
+
+
+
+This function is a shortcut that creates and returns a TCP client object
+connected to a remote address at a given port. Optionally,
+the user can also specify the local address and port to bind
+(locaddr and locport), or restrict the socket family
+to "inet" or "inet6".
+Without specifying family to connect, whether a tcp or tcp6
+connection is created depends on your system configuration. Two variations
+of connect are defined as simple helper functions that restrict the
+family, socket.connect4 and socket.connect6.
+
+
+
+
+
+socket._DEBUG
+
+
+
+This constant is set to true if the library was compiled
+with debug support.
+
+
+
+
+
+socket.gettime()
+
+
+
+Returns the time in seconds, relative to the origin of the
+universe. You should subtract the values returned by this function
+to get meaningful values.
+
+
+
+t = socket.gettime()
+-- do stuff
+print(socket.gettime() - t .. " seconds elapsed")
+
+
+
+
+
+socket.headers.canonic
+
+
The socket.headers.canonic table
+is used by the HTTP and SMTP modules to translate from
+lowercase field names back into their canonic
+capitalization. When a lowercase field name exists as a key
+in this table, the associated value is substituted in
+whenever the field name is sent out.
+
+
+
+You can obtain the headers namespace if case run-time
+modifications are required by running:
+
+
+
+-- loads the headers module
+local headers = require("headers")
+
+
+
+
+
+socket.newtry(finalizer)
+
+
+
+Creates and returns a clean
+try
+function that allows for cleanup before the exception
+is raised.
+
+
+
+Finalizer is a function that will be called before
+try throws the exception. It will be called
+in protected mode.
+
+
+
+The function returns your customized try function.
+
+
+
+Note: This idea saved a lot of work with the
+implementation of protocols in LuaSocket:
+
+
+
+foo = socket.protect(function()
+ -- connect somewhere
+ local c = socket.try(socket.connect("somewhere", 42))
+ -- create a try function that closes 'c' on error
+ local try = socket.newtry(function() c:close() end)
+ -- do everything reassured c will be closed
+ try(c:send("hello there?\r\n"))
+ local answer = try(c:receive())
+ ...
+ try(c:send("good bye\r\n"))
+ c:close()
+end)
+
+
+
+
+
+
+socket.protect(func)
+
+
+
+Converts a function that throws exceptions into a safe function. This
+function only catches exceptions thrown by the try
+and newtry functions. It does not catch normal
+Lua errors.
+
+
+
+Func is a function that calls
+try (or assert, or error)
+to throw exceptions.
+
+
+
+Returns an equivalent function that instead of throwing exceptions,
+returns nil followed by an error message.
+
+
+
+Note: Beware that if your function performs some illegal operation that
+raises an error, the protected function will catch the error and return it
+as a string. This is because the try function
+uses errors as the mechanism to throw exceptions.
+
+
+
+
+
+socket.select(recvt, sendt [, timeout])
+
+
+
+Waits for a number of sockets to change status.
+
+
+
+Recvt is an array with the sockets to test for characters
+available for reading. Sockets in the sendt array are watched to
+see if it is OK to immediately write on them. Timeout is the
+maximum amount of time (in seconds) to wait for a change in status. A
+nil, negative or omitted timeout value allows the
+function to block indefinitely. Recvt and sendt can also
+be empty tables or nil. Non-socket values (or values with
+non-numeric indices) in the arrays will be silently ignored.
+
+
+
The function returns a list with the sockets ready for
+reading, a list with the sockets ready for writing and an error message.
+The error message is "timeout" if a timeout condition was met and
+nil otherwise. The returned tables are
+doubly keyed both by integers and also by the sockets
+themselves, to simplify the test if a specific socket has
+changed status.
+
+
+
+Note: : select can monitor a limited number
+of sockets, as defined by the constant socket._SETSIZE. This
+number may be as high as 1024 or as low as 64 by default,
+depending on the system. It is usually possible to change this
+at compile time. Invoking select with a larger
+number of sockets will raise an error.
+
+
+
+Important note: a known bug in WinSock causes select to fail
+on non-blocking TCP sockets. The function may return a socket as
+writable even though the socket is not ready for sending.
+
+
+
+Another important note: calling select with a server socket in the receive parameter before a call to accept does not guarantee
+accept will return immediately.
+Use the settimeout
+method or accept might block forever.
+
+
+
+Yet another note: If you close a socket and pass
+it to select, it will be ignored.
+
+
+
+Using select with non-socket objects: Any object that implements getfd and dirty can be used with select, allowing objects from other libraries to be used within a socket.select driven loop.
+
+
+
+
+
+socket.sink(mode, socket)
+
+
+
+Creates an
+LTN12
+sink from a stream socket object.
+
+
+
+Mode defines the behavior of the sink. The following
+options are available:
+
+
+
"http-chunked": sends data through socket after applying the
+chunked transfer coding, closing the socket when done;
+
"close-when-done": sends all received data through the
+socket, closing the socket when done;
+
"keep-open": sends all received data through the
+socket, leaving it open when done.
+
+
+Socket is the stream socket object used to send the data.
+
+
+
+The function returns a sink with the appropriate behavior.
+
+
+
+
+
+socket.skip(d [, ret1, ret2 ... retN])
+
+
+
+Drops a number of arguments and returns the remaining.
+
+
+
+D is the number of arguments to drop. Ret1 to
+retN are the arguments.
+
+
+
+The function returns retd+1 to retN.
+
+
+
+Note: This function is useful to avoid creation of dummy variables:
+
+
+
+-- get the status code and separator from SMTP server reply
+local code, sep = socket.skip(2, string.find(line, "^(%d%d%d)(.?)"))
+
+
+
+
+
+socket.sleep(time)
+
+
+
+Freezes the program execution during a given amount of time.
+
+
+
+Time is the number of seconds to sleep for. If
+time is negative, the function returns immediately.
+
+
+
+
+
+socket.source(mode, socket [, length])
+
+
+
+Creates an
+LTN12
+source from a stream socket object.
+
+
+
+Mode defines the behavior of the source. The following
+options are available:
+
+
+
"http-chunked": receives data from socket and removes the
+chunked transfer coding before returning the data;
+
"by-length": receives a fixed number of bytes from the
+socket. This mode requires the extra argument length;
+
"until-closed": receives data from a socket until the other
+side closes the connection.
+
+
+Socket is the stream socket object used to receive the data.
+
+
+
+The function returns a source with the appropriate behavior.
+
+
+
+
+
+socket._SETSIZE
+
+
+
+The maximum number of sockets that the select function can handle.
+
+
+
+
+
+socket.try(ret1 [, ret2 ... retN])
+
+
+
+Throws an exception in case of error. The exception can only be caught
+by the protect function. It does not explode
+into an error message.
+
+
+
+Ret1 to retN can be arbitrary
+arguments, but are usually the return values of a function call
+nested with try.
+
+
+
+The function returns ret1 to retN if
+ret1 is not nil. Otherwise, it calls error passing ret2.
+
+
+
+-- connects or throws an exception with the appropriate error message
+c = socket.try(socket.connect("localhost", 80))
+
+
+
+
+
+socket._VERSION
+
+
+
+This constant has a string describing the current LuaSocket version.
+
+Creates and returns an IPv4 TCP master object. A master object can
+be transformed into a server object with the method
+listen (after a call to bind) or into a client object with
+the method connect. The only other
+method supported by a master object is the
+close method.
+
+
+In case of success, a new master object is returned. In case of error,
+nil is returned, followed by an error message.
+
+
+
+
+
+socket.tcp6()
+
+
+
+Creates and returns an IPv6 TCP master object. A master object can
+be transformed into a server object with the method
+listen (after a call to bind) or into a client object with
+the method connect. The only other
+method supported by a master object is the
+close method.
+
+
+In case of success, a new master object is returned. In case of error,
+nil is returned, followed by an error message.
+
+
+
+Note: The TCP object returned will have the option
+"ipv6-v6only" set to true.
+
+
+
+
+
+server:accept()
+
+
+
+Waits for a remote connection on the server
+object and returns a client object representing that connection.
+
+
+
+If a connection is successfully initiated, a client object is returned.
+If a timeout condition is met, the method returns nil
+followed by the error string 'timeout'. Other errors are
+reported by nil followed by a message describing the error.
+
+
+
+Note: calling socket.select
+with a server object in
+the recvt parameter before a call to accept does
+not guarantee accept will return immediately. Use the settimeout method or accept
+might block until another client shows up.
+
+
+
+
+
+master:bind(address, port)
+
+
+
+Binds a master object to address and port on the
+local host.
+
+
+Address can be an IP address or a host name.
+Port must be an integer number in the range [0..64K).
+If address
+is '*', the system binds to all local interfaces
+using the INADDR_ANY constant or
+IN6ADDR_ANY_INIT, according to the family.
+If port is 0, the system automatically
+chooses an ephemeral port.
+
+
+
+In case of success, the method returns 1. In case of error, the
+method returns nil followed by an error message.
+
+
+
+Note: The function socket.bind
+is available and is a shortcut for the creation of server sockets.
+
+
+
+
+
+master:close()
+client:close()
+server:close()
+
+
+
+Closes a TCP object. The internal socket used by the object is closed
+and the local address to which the object was
+bound is made available to other applications. No further operations
+(except for further calls to the close method) are allowed on
+a closed socket.
+
+
+
+Note: It is important to close all used sockets once they are not
+needed, since, in many systems, each socket uses a file descriptor,
+which are limited system resources. Garbage-collected objects are
+automatically closed before destruction, though.
+
+
+
+
+
+master:connect(address, port)
+
+
+
+Attempts to connect a master object to a remote host, transforming it into a
+client object.
+Client objects support methods
+send,
+receive,
+getsockname,
+getpeername,
+settimeout,
+and close.
+
+
+
+Address can be an IP address or a host name.
+Port must be an integer number in the range [1..64K).
+
+
+
+In case of error, the method returns nil followed by a string
+describing the error. In case of success, the method returns 1.
+
+
+
+Note: The function socket.connect
+is available and is a shortcut for the creation of client sockets.
+
+
+
+Note: Starting with LuaSocket 2.0,
+the settimeout
+method affects the behavior of connect, causing it to return
+with an error in case of a timeout. If that happens, you can still call socket.select with the socket in the
+sendt table. The socket will be writable when the connection is
+established.
+
+
+
+Note: Starting with LuaSocket 2.1, the host name resolution
+depends on whether the socket was created by socket.tcp or socket.tcp6. Addresses from
+the appropriate family are tried in succession until the
+first success or until the last failure.
+
+
+
+
+
+client:getpeername()
+
+
+
+Returns information about the remote side of a connected client object.
+
+
+
+Returns a string with the IP address of the peer, the
+port number that peer is using for the connection,
+and a string with the family ("inet" or "inet6").
+In case of error, the method returns nil.
+
+
+
+Note: It makes no sense to call this method on server objects.
+
+Returns the local address information associated to the object.
+
+
+
+The method returns a string with local IP address, a number with
+the local port,
+and a string with the family ("inet" or "inet6").
+In case of error, the method returns nil.
+
+Returns accounting information on the socket, useful for throttling
+of bandwidth.
+
+
+
+The method returns the number of bytes received, the number of bytes sent,
+and the age of the socket object in seconds.
+
+
+
+
+
+master:listen(backlog)
+
+
+
+Specifies the socket is willing to receive connections, transforming the
+object into a server object. Server objects support the
+accept,
+getsockname,
+setoption,
+settimeout,
+and close methods.
+
+
+
+The parameter backlog specifies the number of client
+connections that can
+be queued waiting for service. If the queue is full and another client
+attempts connection, the connection is refused.
+
+
+
+In case of success, the method returns 1. In case of error, the
+method returns nil followed by an error message.
+
+
+
+
+
+client:receive([pattern [, prefix]])
+
+
+
+Reads data from a client object, according to the specified read
+pattern. Patterns follow the Lua file I/O format, and the difference in performance between all patterns is negligible.
+
+
+
+Pattern can be any of the following:
+
+
+
+
'*a': reads from the socket until the connection is
+closed. No end-of-line translation is performed;
+
'*l': reads a line of text from the socket. The line is
+terminated by a LF character (ASCII 10), optionally preceded by a
+CR character (ASCII 13). The CR and LF characters are not included in
+the returned line. In fact, all CR characters are
+ignored by the pattern. This is the default pattern;
+
number: causes the method to read a specified number
+of bytes from the socket.
+
+
+
+Prefix is an optional string to be concatenated to the beginning
+of any received data before return.
+
+
+
+If successful, the method returns the received pattern. In case of error,
+the method returns nil followed by an error
+message, followed by a (possibly empty) string containing
+the partial that was received. The error message can be
+the string 'closed' in case the connection was
+closed before the transmission was completed or the string
+'timeout' in case there was a timeout during the operation.
+
+
+
+Important note: This function was changed severely. It used
+to support multiple patterns (but I have never seen this feature used) and
+now it doesn't anymore. Partial results used to be returned in the same
+way as successful results. This last feature violated the idea that all
+functions should return nil on error. Thus it was changed
+too.
+
+
+
+
+
+client:send(data [, i [, j]])
+
+
+
+Sends data through client object.
+
+
+
+Data is the string to be sent. The optional arguments
+i and j work exactly like the standard
+string.sub Lua function to allow the selection of a
+substring to be sent.
+
+
+
+If successful, the method returns the index of the last byte
+within [i, j] that has been sent. Notice that, if
+i is 1 or absent, this is effectively the total
+number of bytes sent. In case of error, the method returns
+nil, followed by an error message, followed
+by the index of the last byte within [i, j] that
+has been sent. You might want to try again from the byte
+following that. The error message can be 'closed'
+in case the connection was closed before the transmission
+was completed or the string 'timeout' in case
+there was a timeout during the operation.
+
+
+
+Note: Output is not buffered. For small strings,
+it is always better to concatenate them in Lua
+(with the '..' operator) and send the result in one call
+instead of calling the method several times.
+
+Sets options for the TCP object. Options are only needed by low-level or
+time-critical applications. You should only modify an option if you
+are sure you need it.
+
+
+
+Option is a string with the option name, and value
+depends on the option being set:
+
+
+
+
'keepalive': Setting this option to true enables
+the periodic transmission of messages on a connected socket. Should the
+connected party fail to respond to these messages, the connection is
+considered broken and processes using the socket are notified;
+
+
'linger': Controls the action taken when unsent data are
+queued on a socket and a close is performed. The value is a table with a
+boolean entry 'on' and a numeric entry for the time interval
+'timeout' in seconds. If the 'on' field is set to
+true, the system will block the process on the close attempt until
+it is able to transmit the data or until 'timeout' has passed. If
+'on' is false and a close is issued, the system will
+process the close in a manner that allows the process to continue as
+quickly as possible. I do not advise you to set this to anything other than
+zero;
+
+
'reuseaddr': Setting this option indicates that the rules
+used in validating addresses supplied in a call to
+bind should allow reuse of local addresses;
+
+
'tcp-nodelay': Setting this option to true
+disables the Nagle's algorithm for the connection;
+
+
'ipv6-v6only':
+Setting this option to true restricts an inet6 socket to
+sending and receiving only IPv6 packets.
+
+
+
+The method returns 1 in case of success, or nil
+followed by an error message otherwise.
+
+
+
+Note: The descriptions above come from the man pages.
+
+Changes the timeout values for the object. By default,
+all I/O operations are blocking. That is, any call to the methods
+send,
+receive, and
+accept
+will block indefinitely, until the operation completes. The
+settimeout method defines a limit on the amount of time the
+I/O methods can block. When a timeout is set and the specified amount of
+time has elapsed, the affected methods give up and fail with an error code.
+
+
+
+The amount of time to wait is specified as the
+value parameter, in seconds. There are two timeout modes and
+both can be used together for fine tuning:
+
+
+
+
'b': block timeout. Specifies the upper limit on
+the amount of time LuaSocket can be blocked by the operating system
+while waiting for completion of any single I/O operation. This is the
+default mode;
+
+
't': total timeout. Specifies the upper limit on
+the amount of time LuaSocket can block a Lua script before returning from
+a call.
+
+
+
+The nil timeout value allows operations to block
+indefinitely. Negative timeout values have the same effect.
+
+
+
+Note: although timeout values have millisecond precision in LuaSocket,
+large blocks can cause I/O functions not to respect timeout values due
+to the time the library takes to transfer blocks to and from the OS
+and to and from the Lua interpreter. Also, function that accept host names
+and perform automatic name resolution might be blocked by the resolver for
+longer than the specified timeout value.
+
+
+
+Note: The old timeout method is deprecated. The name has been
+changed for sake of uniformity, since all other method names already
+contained verbs making their imperative nature obvious.
+
+
+
+
+
+client:shutdown(mode)
+
+
+
+Shuts down part of a full-duplex connection.
+
+
+
+Mode tells which way of the connection should be shut down and can
+take the value:
+
+
"both": disallow further sends and receives on the object.
+This is the default mode;
+
"send": disallow further sends on the object;
+
"receive": disallow further receives on the object.
+
+
+
+This function returns 1.
+
+
+
+
+
+master:dirty()
+client:dirty()
+server:dirty()
+
+
+
+Check the read buffer status.
+
+
+
+Returns true if there is any data in the read buffer, false otherwise.
+
+
+
+Note: This is an internal method, any use is unlikely to be portable.
+
+
+
+
+
+master:getfd()
+client:getfd()
+server:getfd()
+
+
+
+Returns the underling socket descriptor or handle associated to the object.
+
+
+
+The descriptor or handle. In case the object has been closed, the return will be -1.
+
+
+
+Note: This is an internal method, any use is unlikely to be portable.
+
+Sets the underling socket descriptor or handle associated to the object. The current one is simply replaced, not closed, and no other change to the object state is made.
+
+
+
+No return value.
+
+
+
+Note: This is an internal method, any use is unlikely to be portable.
+
+In case of success, a new unconnected UDP object
+returned. In case of error, nil is returned, followed by
+an error message.
+
+
+
+Note: The TCP object returned will have the option
+"ipv6-v6only" set to true.
+
+
+
+
+
+
+
+
+
+connected:close()
+unconnected:close()
+
+
+
+Closes a UDP object. The internal socket
+used by the object is closed and the local address to which the
+object was bound is made available to other applications. No
+further operations (except for further calls to the close
+method) are allowed on a closed socket.
+
+
+
+Note: It is important to close all used sockets
+once they are not needed, since, in many systems, each socket uses
+a file descriptor, which are limited system resources.
+Garbage-collected objects are automatically closed before
+destruction, though.
+
+
+
+
+
+connected:getpeername()
+
+
+
+Retrieves information about the peer
+associated with a connected UDP object.
+
+
+
+
+Returns a string with the IP address of the peer, the
+port number that peer is using for the connection,
+and a string with the family ("inet" or "inet6").
+In case of error, the method returns nil.
+
+
+
+Note: It makes no sense to call this method on unconnected objects.
+
+Returns the local address information associated to the object.
+
+
+
+
+The method returns a string with local IP address, a number with
+the local port,
+and a string with the family ("inet" or "inet6").
+In case of error, the method returns nil.
+
+
+
+Note: UDP sockets are not bound to any address
+until the setsockname or the
+sendto method is called for the
+first time (in which case it is bound to an ephemeral port and the
+wild-card address).
+
+Receives a datagram from the UDP object. If
+the UDP object is connected, only datagrams coming from the peer
+are accepted. Otherwise, the returned datagram can come from any
+host.
+
+
+
+The optional size parameter
+specifies the maximum size of the datagram to be retrieved. If
+there are more than size bytes available in the datagram,
+the excess bytes are discarded. If there are less then
+size bytes available in the current datagram, the
+available bytes are returned. If size is omitted, the
+maximum datagram size is used (which is currently limited by the
+implementation to 8192 bytes).
+
+
+
+In case of success, the method returns the
+received datagram. In case of timeout, the method returns
+nil followed by the string 'timeout'.
+
+
+
+
+
+unconnected:receivefrom([size])
+
+
+
+Works exactly as the receive
+method, except it returns the IP
+address and port as extra return values (and is therefore slightly less
+efficient).
+
+
+
+
+
+connected:getoption()
+unconnected:getoption()
+
+
+
+Gets an option value from the UDP object.
+See setoption for
+description of the option names and values.
+
+
+
Option is a string with the option name.
+
+
'dontroute'
+
'broadcast'
+
'reuseaddr'
+
'reuseport'
+
'ip-multicast-loop'
+
'ipv6-v6only'
+
'ip-multicast-if'
+
'ip-multicast-ttl'
+
'ip-add-membership'
+
'ip-drop-membership'
+
+
+
+
+The method returns the option value in case of
+success, or
+nil followed by an error message otherwise.
+
+
+
+
+
+connected:send(datagram)
+
+
+
+Sends a datagram to the UDP peer of a connected object.
+
+
+
+Datagram is a string with the datagram contents.
+The maximum datagram size for UDP is 64K minus IP layer overhead.
+However datagrams larger than the link layer packet size will be
+fragmented, which may deteriorate performance and/or reliability.
+
+
+
+If successful, the method returns 1. In case of
+error, the method returns nil followed by an error message.
+
+
+
+Note: In UDP, the send method never blocks
+and the only way it can fail is if the underlying transport layer
+refuses to send a message to the specified address (i.e. no
+interface accepts the address).
+
+
+
+
+
+unconnected:sendto(datagram, ip, port)
+
+
+
+Sends a datagram to the specified IP address and port number.
+
+
+
+Datagram is a string with the
+datagram contents.
+The maximum datagram size for UDP is 64K minus IP layer overhead.
+However datagrams larger than the link layer packet size will be
+fragmented, which may deteriorate performance and/or reliability.
+Ip is the IP address of the recipient.
+Host names are not allowed for performance reasons.
+
+Port is the port number at the recipient.
+
+
+
+If successful, the method returns 1. In case of
+error, the method returns nil followed by an error message.
+
+
+
+Note: In UDP, the send method never blocks
+and the only way it can fail is if the underlying transport layer
+refuses to send a message to the specified address (i.e. no
+interface accepts the address).
+
+Changes the peer of a UDP object. This
+method turns an unconnected UDP object into a connected UDP
+object or vice versa.
+
+
+
+For connected objects, outgoing datagrams
+will be sent to the specified peer, and datagrams received from
+other peers will be discarded by the OS. Connected UDP objects must
+use the send and
+receive methods instead of
+sendto and
+receivefrom.
+
+
+
+Address can be an IP address or a
+host name. Port is the port number. If address is
+'*' and the object is connected, the peer association is
+removed and the object becomes an unconnected object again. In that
+case, the port argument is ignored.
+
+
+
+In case of error the method returns
+nil followed by an error message. In case of success, the
+method returns 1.
+
+
+
+Note: Since the address of the peer does not have
+to be passed to and from the OS, the use of connected UDP objects
+is recommended when the same peer is used for several transmissions
+and can result in up to 30% performance gains.
+
+
+
+Note: Starting with LuaSocket 2.1, the host name resolution
+depends on whether the socket was created by socket.udp or socket.udp6. Addresses from
+the appropriate family are tried in succession until the
+first success or until the last failure.
+
+
+
+
+
+unconnected:setsockname(address, port)
+
+
+
+Binds the UDP object to a local address.
+
+
+
+Address can be an IP address or a
+host name. If address is '*' the system binds to
+all local interfaces using the constant INADDR_ANY. If
+port is 0, the system chooses an ephemeral port.
+
+
+
+If successful, the method returns 1. In case of
+error, the method returns nil followed by an error
+message.
+
+
+
+Note: This method can only be called before any
+datagram is sent through the UDP object, and only once. Otherwise,
+the system automatically binds the object to all local interfaces
+and chooses an ephemeral port as soon as the first datagram is
+sent. After the local address is set, either automatically by the
+system or explicitly by setsockname, it cannot be
+changed.
+
+Sets options for the UDP object. Options are
+only needed by low-level or time-critical applications. You should
+only modify an option if you are sure you need it.
+
Option is a string with the option
+name, and value depends on the option being set:
+
+
+
+
'dontroute': Indicates that outgoing
+messages should bypass the standard routing facilities.
+Receives a boolean value;
+
'broadcast': Requests permission to send
+broadcast datagrams on the socket.
+Receives a boolean value;
+
'reuseaddr': Indicates that the rules used in
+validating addresses supplied in a bind() call
+should allow reuse of local addresses.
+Receives a boolean value;
+
'reuseport': Allows completely duplicate
+bindings by multiple processes if they all set
+'reuseport' before binding the port.
+Receives a boolean value;
+
'ip-multicast-loop':
+Specifies whether or not a copy of an outgoing multicast
+datagram is delivered to the sending host as long as it is a
+member of the multicast group.
+Receives a boolean value;
+
'ipv6-v6only':
+Specifies whether to restrict inet6 sockets to
+sending and receiving only IPv6 packets.
+Receive a boolean value;
+
'ip-multicast-if':
+Sets the interface over which outgoing multicast datagrams
+are sent.
+Receives an IP address;
+
'ip-multicast-ttl':
+Sets the Time To Live in the IP header for outgoing
+multicast datagrams.
+Receives a number;
+
'ip-add-membership':
+Joins the multicast group specified.
+Receives a table with fields
+multiaddr and interface, each containing an
+IP address;
+
'ip-drop-membership': Leaves the multicast
+group specified.
+Receives a table with fields
+multiaddr and interface, each containing an
+IP address.
+
+
+
+The method returns 1 in case of success, or
+nil followed by an error message otherwise.
+
+
+
+Note: The descriptions above come from the man pages.
+
+Changes the timeout values for the object. By default, the
+receive and
+receivefrom
+operations are blocking. That is, any call to the methods will block
+indefinitely, until data arrives. The settimeout function defines
+a limit on the amount of time the functions can block. When a timeout is
+set and the specified amount of time has elapsed, the affected methods
+give up and fail with an error code.
+
+
+
+The amount of time to wait is specified as
+the value parameter, in seconds. The nil timeout
+value allows operations to block indefinitely. Negative
+timeout values have the same effect.
+
+
+
+Note: In UDP, the send
+and sendto methods never block (the
+datagram is just passed to the OS and the call returns
+immediately). Therefore, the settimeout method has no
+effect on them.
+
+
+
+Note: The old timeout method is
+deprecated. The name has been changed for sake of uniformity, since
+all other method names already contained verbs making their
+imperative nature obvious.
+
+The url namespace provides functions to parse, protect,
+and build URLs, as well as functions to compose absolute URLs
+from base and relative URLs, according to
+RFC 2396.
+
+
+
+To obtain the url namespace, run:
+
+
+
+-- loads the URL module
+local url = require("socket.url")
+
+Builds an absolute URL from a base URL and a relative URL.
+
+
+
+Base is a string with the base URL or
+a parsed URL table. Relative is a
+string with the relative URL.
+
+
+
+The function returns a string with the absolute URL.
+
+
+
+Note: The rules that
+govern the composition are fairly complex, and are described in detail in
+RFC 2396.
+The example bellow should give an idea of what the rules are.
+
+Parsed_url is a table with same components returned by
+parse.
+Lower level components, if specified,
+take precedence over high level components of the URL grammar.
+
+
+
+The function returns a string with the built URL.
+
+
+
+
+
+url.build_path(segments, unsafe)
+
+
+
+Builds a <path> component from a list of
+<segment> parts.
+Before composition, any reserved characters found in a segment are escaped into
+their protected form, so that the resulting path is a valid URL path
+component.
+
+
+
+Segments is a list of strings with the <segment>
+parts. If unsafe is anything but nil, reserved
+characters are left untouched.
+
+
+
+The function returns a string with the
+built <path> component.
+
+
+
+
+
+url.escape(content)
+
+
+
+Applies the URL escaping content coding to a string
+Each byte is encoded as a percent character followed
+by the two byte hexadecimal representation of its integer
+value.
+
+Parses an URL given as a string into a Lua table with its components.
+
+
+
+Url is the URL to be parsed. If the default table is
+present, it is used to store the parsed fields. Only fields present in the
+URL are overwritten. Therefore, this table can be used to pass default
+values for each field.
+
+
+
+The function returns a table with all the URL components:
+
+Breaks a <path> URL component into all its
+<segment> parts.
+
+
+
+Path is a string with the path to be parsed.
+
+
+
+Since some characters are reserved in URLs, they must be escaped
+whenever present in a <path> component. Therefore, before
+returning a list with all the parsed segments, the function removes
+escaping from all of them.
+
+
+
+
+
+url.unescape(content)
+
+
+
+Removes the URL escaping content coding from a string.
+
+
+
+Content is the string to be decoded.
+
+
+
+The function returns the decoded string.
+
+
+
+
+
+
+
+
diff --git a/etc/README b/etc/README
new file mode 100644
index 0000000..cfd3e37
--- /dev/null
+++ b/etc/README
@@ -0,0 +1,89 @@
+This directory contains code that is more useful than the
+samples. This code *is* supported.
+
+ tftp.lua -- Trivial FTP client
+
+This module implements file retrieval by the TFTP protocol.
+Its main use was to test the UDP code, but since someone
+found it usefull, I turned it into a module that is almost
+official (no uploads, yet).
+
+ dict.lua -- Dict client
+
+The dict.lua module started with a cool simple client
+for the DICT protocol, written by Luiz Henrique Figueiredo.
+This new version has been converted into a library, similar
+to the HTTP and FTP libraries, that can be used from within
+any luasocket application. Take a look on the source code
+and you will be able to figure out how to use it.
+
+ lp.lua -- LPD client library
+
+The lp.lua module implements the client part of the Line
+Printer Daemon protocol, used to print files on Unix
+machines. It is courtesy of David Burgess! See the source
+code and the lpr.lua in the examples directory.
+
+ b64.lua
+ qp.lua
+ eol.lua
+
+These are tiny programs that perform Base64,
+Quoted-Printable and end-of-line marker conversions.
+
+ get.lua -- file retriever
+
+This little program is a client that uses the FTP and
+HTTP code to implement a command line file graber. Just
+run
+
+ lua get.lua []
+
+to download a remote file (either ftp:// or http://) to
+the specified local file. The program also prints the
+download throughput, elapsed time, bytes already downloaded
+etc during download.
+
+ check-memory.lua -- checks memory consumption
+
+This is just to see how much memory each module uses.
+
+ dispatch.lua -- coroutine based dispatcher
+
+This is a first try at a coroutine based non-blocking
+dispatcher for LuaSocket. Take a look at 'check-links.lua'
+and at 'forward.lua' to see how to use it.
+
+ check-links.lua -- HTML link checker program
+
+This little program scans a HTML file and checks for broken
+links. It is similar to check-links.pl by Jamie Zawinski,
+but uses all facilities of the LuaSocket library and the Lua
+language. It has not been thoroughly tested, but it should
+work. Just run
+
+ lua check-links.lua [-n] {} > output
+
+and open the result to see a list of broken links. Make sure
+you check the '-n' switch. It runs in non-blocking mode,
+using coroutines, and is MUCH faster!
+
+ forward.lua -- coroutine based forward server
+
+This is a forward server that can accept several connections
+and transfers simultaneously using non-blocking I/O and the
+coroutine-based dispatcher. You can run, for example
+
+ lua forward.lua 8080:proxy.com:3128
+
+to redirect all local conections to port 8080 to the host
+'proxy.com' at port 3128.
+
+ unix.c and unix.h
+
+This is an implementation of Unix local domain sockets and
+demonstrates how to extend LuaSocket with a new type of
+transport. It has been tested on Linux and on Mac OS X.
+
+Good luck,
+Diego.
diff --git a/etc/b64.lua b/etc/b64.lua
new file mode 100644
index 0000000..11eeb2d
--- /dev/null
+++ b/etc/b64.lua
@@ -0,0 +1,19 @@
+-----------------------------------------------------------------------------
+-- Little program to convert to and from Base64
+-- LuaSocket sample files
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+local ltn12 = require("ltn12")
+local mime = require("mime")
+local source = ltn12.source.file(io.stdin)
+local sink = ltn12.sink.file(io.stdout)
+local convert
+if arg and arg[1] == '-d' then
+ convert = mime.decode("base64")
+else
+ local base64 = mime.encode("base64")
+ local wrap = mime.wrap()
+ convert = ltn12.filter.chain(base64, wrap)
+end
+sink = ltn12.sink.chain(convert, sink)
+ltn12.pump.all(source, sink)
diff --git a/etc/check-links.lua b/etc/check-links.lua
new file mode 100644
index 0000000..283f3ac
--- /dev/null
+++ b/etc/check-links.lua
@@ -0,0 +1,111 @@
+-----------------------------------------------------------------------------
+-- Little program that checks links in HTML files, using coroutines and
+-- non-blocking I/O via the dispatcher module.
+-- LuaSocket sample files
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+local url = require("socket.url")
+local dispatch = require("dispatch")
+local http = require("socket.http")
+dispatch.TIMEOUT = 10
+
+-- make sure the user knows how to invoke us
+arg = arg or {}
+if #arg < 1 then
+ print("Usage:\n luasocket check-links.lua [-n] {}")
+ exit()
+end
+
+-- '-n' means we are running in non-blocking mode
+if arg[1] == "-n" then
+ -- if non-blocking I/O was requested, use real dispatcher interface
+ table.remove(arg, 1)
+ handler = dispatch.newhandler("coroutine")
+else
+ -- if using blocking I/O, use fake dispatcher interface
+ handler = dispatch.newhandler("sequential")
+end
+
+local nthreads = 0
+
+-- get the status of a URL using the dispatcher
+function getstatus(link)
+ local parsed = url.parse(link, {scheme = "file"})
+ if parsed.scheme == "http" then
+ nthreads = nthreads + 1
+ handler:start(function()
+ local r, c, h, s = http.request{
+ method = "HEAD",
+ url = link,
+ create = handler.tcp
+ }
+ if r and c == 200 then io.write('\t', link, '\n')
+ else io.write('\t', link, ': ', tostring(c), '\n') end
+ nthreads = nthreads - 1
+ end)
+ end
+end
+
+function readfile(path)
+ path = url.unescape(path)
+ local file, error = io.open(path, "r")
+ if file then
+ local body = file:read("*a")
+ file:close()
+ return body
+ else return nil, error end
+end
+
+function load(u)
+ local parsed = url.parse(u, { scheme = "file" })
+ local body, headers, code, error
+ local base = u
+ if parsed.scheme == "http" then
+ body, code, headers = http.request(u)
+ if code == 200 then
+ -- if there was a redirect, update base to reflect it
+ base = headers.location or base
+ end
+ if not body then
+ error = code
+ end
+ elseif parsed.scheme == "file" then
+ body, error = readfile(parsed.path)
+ else error = string.format("unhandled scheme '%s'", parsed.scheme) end
+ return base, body, error
+end
+
+function getlinks(body, base)
+ -- get rid of comments
+ body = string.gsub(body, "%<%!%-%-.-%-%-%>", "")
+ local links = {}
+ -- extract links
+ body = string.gsub(body, '[Hh][Rr][Ee][Ff]%s*=%s*"([^"]*)"', function(href)
+ table.insert(links, url.absolute(base, href))
+ end)
+ body = string.gsub(body, "[Hh][Rr][Ee][Ff]%s*=%s*'([^']*)'", function(href)
+ table.insert(links, url.absolute(base, href))
+ end)
+ string.gsub(body, "[Hh][Rr][Ee][Ff]%s*=%s*(.-)>", function(href)
+ table.insert(links, url.absolute(base, href))
+ end)
+ return links
+end
+
+function checklinks(address)
+ local base, body, error = load(address)
+ if not body then print(error) return end
+ print("Checking ", base)
+ local links = getlinks(body, base)
+ for _, link in ipairs(links) do
+ getstatus(link)
+ end
+end
+
+for _, address in ipairs(arg) do
+ checklinks(url.absolute("file:", address))
+end
+
+while nthreads > 0 do
+ handler:step()
+end
diff --git a/etc/check-memory.lua b/etc/check-memory.lua
new file mode 100644
index 0000000..7bd984d
--- /dev/null
+++ b/etc/check-memory.lua
@@ -0,0 +1,17 @@
+function load(s)
+ collectgarbage()
+ local a = gcinfo()
+ _G[s] = require(s)
+ collectgarbage()
+ local b = gcinfo()
+ print(s .. ":\t " .. (b-a) .. "k")
+end
+
+load("socket.url")
+load("ltn12")
+load("socket")
+load("mime")
+load("socket.tp")
+load("socket.smtp")
+load("socket.http")
+load("socket.ftp")
diff --git a/etc/cookie.lua b/etc/cookie.lua
new file mode 100644
index 0000000..4adb403
--- /dev/null
+++ b/etc/cookie.lua
@@ -0,0 +1,88 @@
+local socket = require"socket"
+local http = require"socket.http"
+local url = require"socket.url"
+local ltn12 = require"ltn12"
+
+local token_class = '[^%c%s%(%)%<%>%@%,%;%:%\\%"%/%[%]%?%=%{%}]'
+
+local function unquote(t, quoted)
+ local n = string.match(t, "%$(%d+)$")
+ if n then n = tonumber(n) end
+ if quoted[n] then return quoted[n]
+ else return t end
+end
+
+local function parse_set_cookie(c, quoted, cookie_table)
+ c = c .. ";$last=last;"
+ local _, __, n, v, i = string.find(c, "(" .. token_class ..
+ "+)%s*=%s*(.-)%s*;%s*()")
+ local cookie = {
+ name = n,
+ value = unquote(v, quoted),
+ attributes = {}
+ }
+ while 1 do
+ _, __, n, v, i = string.find(c, "(" .. token_class ..
+ "+)%s*=?%s*(.-)%s*;%s*()", i)
+ if not n or n == "$last" then break end
+ cookie.attributes[#cookie.attributes+1] = {
+ name = n,
+ value = unquote(v, quoted)
+ }
+ end
+ cookie_table[#cookie_table+1] = cookie
+end
+
+local function split_set_cookie(s, cookie_table)
+ cookie_table = cookie_table or {}
+ -- remove quoted strings from cookie list
+ local quoted = {}
+ s = string.gsub(s, '"(.-)"', function(q)
+ quoted[#quoted+1] = q
+ return "$" .. #quoted
+ end)
+ -- add sentinel
+ s = s .. ",$last="
+ -- split into individual cookies
+ i = 1
+ while 1 do
+ local _, __, cookie, next_token
+ _, __, cookie, i, next_token = string.find(s, "(.-)%s*%,%s*()(" ..
+ token_class .. "+)%s*=", i)
+ if not next_token then break end
+ parse_set_cookie(cookie, quoted, cookie_table)
+ if next_token == "$last" then break end
+ end
+ return cookie_table
+end
+
+local function quote(s)
+ if string.find(s, "[ %,%;]") then return '"' .. s .. '"'
+ else return s end
+end
+
+local _empty = {}
+local function build_cookies(cookies)
+ s = ""
+ for i,v in ipairs(cookies or _empty) do
+ if v.name then
+ s = s .. v.name
+ if v.value and v.value ~= "" then
+ s = s .. '=' .. quote(v.value)
+ end
+ end
+ if v.name and #(v.attributes or _empty) > 0 then s = s .. "; " end
+ for j,u in ipairs(v.attributes or _empty) do
+ if u.name then
+ s = s .. u.name
+ if u.value and u.value ~= "" then
+ s = s .. '=' .. quote(u.value)
+ end
+ end
+ if j < #v.attributes then s = s .. "; " end
+ end
+ if i < #cookies then s = s .. ", " end
+ end
+ return s
+end
+
diff --git a/etc/dict.lua b/etc/dict.lua
new file mode 100644
index 0000000..8c5b711
--- /dev/null
+++ b/etc/dict.lua
@@ -0,0 +1,151 @@
+-----------------------------------------------------------------------------
+-- Little program to download DICT word definitions
+-- LuaSocket sample files
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+
+-----------------------------------------------------------------------------
+-- Load required modules
+-----------------------------------------------------------------------------
+local base = _G
+local string = require("string")
+local table = require("table")
+local socket = require("socket")
+local url = require("socket.url")
+local tp = require("socket.tp")
+module("socket.dict")
+
+-----------------------------------------------------------------------------
+-- Globals
+-----------------------------------------------------------------------------
+HOST = "dict.org"
+PORT = 2628
+TIMEOUT = 10
+
+-----------------------------------------------------------------------------
+-- Low-level dict API
+-----------------------------------------------------------------------------
+local metat = { __index = {} }
+
+function open(host, port)
+ local tp = socket.try(tp.connect(host or HOST, port or PORT, TIMEOUT))
+ return base.setmetatable({tp = tp}, metat)
+end
+
+function metat.__index:greet()
+ return socket.try(self.tp:check(220))
+end
+
+function metat.__index:check(ok)
+ local code, status = socket.try(self.tp:check(ok))
+ return code,
+ base.tonumber(socket.skip(2, string.find(status, "^%d%d%d (%d*)")))
+end
+
+function metat.__index:getdef()
+ local line = socket.try(self.tp:receive())
+ local def = {}
+ while line ~= "." do
+ table.insert(def, line)
+ line = socket.try(self.tp:receive())
+ end
+ return table.concat(def, "\n")
+end
+
+function metat.__index:define(database, word)
+ database = database or "!"
+ socket.try(self.tp:command("DEFINE", database .. " " .. word))
+ local code, count = self:check(150)
+ local defs = {}
+ for i = 1, count do
+ self:check(151)
+ table.insert(defs, self:getdef())
+ end
+ self:check(250)
+ return defs
+end
+
+function metat.__index:match(database, strat, word)
+ database = database or "!"
+ strat = strat or "."
+ socket.try(self.tp:command("MATCH", database .." ".. strat .." ".. word))
+ self:check(152)
+ local mat = {}
+ local line = socket.try(self.tp:receive())
+ while line ~= '.' do
+ database, word = socket.skip(2, string.find(line, "(%S+) (.*)"))
+ if not mat[database] then mat[database] = {} end
+ table.insert(mat[database], word)
+ line = socket.try(self.tp:receive())
+ end
+ self:check(250)
+ return mat
+end
+
+function metat.__index:quit()
+ self.tp:command("QUIT")
+ return self:check(221)
+end
+
+function metat.__index:close()
+ return self.tp:close()
+end
+
+-----------------------------------------------------------------------------
+-- High-level dict API
+-----------------------------------------------------------------------------
+local default = {
+ scheme = "dict",
+ host = "dict.org"
+}
+
+local function there(f)
+ if f == "" then return nil
+ else return f end
+end
+
+local function parse(u)
+ local t = socket.try(url.parse(u, default))
+ socket.try(t.scheme == "dict", "invalid scheme '" .. t.scheme .. "'")
+ socket.try(t.path, "invalid path in url")
+ local cmd, arg = socket.skip(2, string.find(t.path, "^/(.)(.*)$"))
+ socket.try(cmd == "d" or cmd == "m", " should be 'm' or 'd'")
+ socket.try(arg and arg ~= "", "need at least in URL")
+ t.command, t.argument = cmd, arg
+ arg = string.gsub(arg, "^:([^:]+)", function(f) t.word = f end)
+ socket.try(t.word, "need at least in URL")
+ arg = string.gsub(arg, "^:([^:]*)", function(f) t.database = there(f) end)
+ if cmd == "m" then
+ arg = string.gsub(arg, "^:([^:]*)", function(f) t.strat = there(f) end)
+ end
+ string.gsub(arg, ":([^:]*)$", function(f) t.n = base.tonumber(f) end)
+ return t
+end
+
+local function tget(gett)
+ local con = open(gett.host, gett.port)
+ con:greet()
+ if gett.command == "d" then
+ local def = con:define(gett.database, gett.word)
+ con:quit()
+ con:close()
+ if gett.n then return def[gett.n]
+ else return def end
+ elseif gett.command == "m" then
+ local mat = con:match(gett.database, gett.strat, gett.word)
+ con:quit()
+ con:close()
+ return mat
+ else return nil, "invalid command" end
+end
+
+local function sget(u)
+ local gett = parse(u)
+ return tget(gett)
+end
+
+get = socket.protect(function(gett)
+ if base.type(gett) == "string" then return sget(gett)
+ else return tget(gett) end
+end)
+
diff --git a/etc/dispatch.lua b/etc/dispatch.lua
new file mode 100644
index 0000000..cab7f59
--- /dev/null
+++ b/etc/dispatch.lua
@@ -0,0 +1,300 @@
+-----------------------------------------------------------------------------
+-- A hacked dispatcher module
+-- LuaSocket sample files
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+local base = _G
+local table = require("table")
+local socket = require("socket")
+local coroutine = require("coroutine")
+module("dispatch")
+
+-- if too much time goes by without any activity in one of our sockets, we
+-- just kill it
+TIMEOUT = 60
+
+-----------------------------------------------------------------------------
+-- We implement 3 types of dispatchers:
+-- sequential
+-- coroutine
+-- threaded
+-- The user can choose whatever one is needed
+-----------------------------------------------------------------------------
+local handlert = {}
+
+-- default handler is coroutine
+function newhandler(mode)
+ mode = mode or "coroutine"
+ return handlert[mode]()
+end
+
+local function seqstart(self, func)
+ return func()
+end
+
+-- sequential handler simply calls the functions and doesn't wrap I/O
+function handlert.sequential()
+ return {
+ tcp = socket.tcp,
+ start = seqstart
+ }
+end
+
+-----------------------------------------------------------------------------
+-- Mega hack. Don't try to do this at home.
+-----------------------------------------------------------------------------
+-- we can't yield across calls to protect, so we rewrite it with coxpcall
+-- make sure you don't require any module that uses socket.protect before
+-- loading our hack
+function socket.protect(f)
+ return function(...)
+ local co = coroutine.create(f)
+ while true do
+ local results = {coroutine.resume(co, ...)}
+ local status = table.remove(results, 1)
+ if not status then
+ if base.type(results[1]) == 'table' then
+ return nil, results[1][1]
+ else base.error(results[1]) end
+ end
+ if coroutine.status(co) == "suspended" then
+ arg = {coroutine.yield(base.unpack(results))}
+ else
+ return base.unpack(results)
+ end
+ end
+ end
+end
+
+-----------------------------------------------------------------------------
+-- Simple set data structure. O(1) everything.
+-----------------------------------------------------------------------------
+local function newset()
+ local reverse = {}
+ local set = {}
+ return base.setmetatable(set, {__index = {
+ insert = function(set, value)
+ if not reverse[value] then
+ table.insert(set, value)
+ reverse[value] = #set
+ end
+ end,
+ remove = function(set, value)
+ local index = reverse[value]
+ if index then
+ reverse[value] = nil
+ local top = table.remove(set)
+ if top ~= value then
+ reverse[top] = index
+ set[index] = top
+ end
+ end
+ end
+ }})
+end
+
+-----------------------------------------------------------------------------
+-- socket.tcp() wrapper for the coroutine dispatcher
+-----------------------------------------------------------------------------
+local function cowrap(dispatcher, tcp, error)
+ if not tcp then return nil, error end
+ -- put it in non-blocking mode right away
+ tcp:settimeout(0)
+ -- metatable for wrap produces new methods on demand for those that we
+ -- don't override explicitly.
+ local metat = { __index = function(table, key)
+ table[key] = function(...)
+ return tcp[key](tcp,select(2,...))
+ end
+ return table[key]
+ end}
+ -- does our user want to do his own non-blocking I/O?
+ local zero = false
+ -- create a wrap object that will behave just like a real socket object
+ local wrap = { }
+ -- we ignore settimeout to preserve our 0 timeout, but record whether
+ -- the user wants to do his own non-blocking I/O
+ function wrap:settimeout(value, mode)
+ if value == 0 then zero = true
+ else zero = false end
+ return 1
+ end
+ -- send in non-blocking mode and yield on timeout
+ function wrap:send(data, first, last)
+ first = (first or 1) - 1
+ local result, error
+ while true do
+ -- return control to dispatcher and tell it we want to send
+ -- if upon return the dispatcher tells us we timed out,
+ -- return an error to whoever called us
+ if coroutine.yield(dispatcher.sending, tcp) == "timeout" then
+ return nil, "timeout"
+ end
+ -- try sending
+ result, error, first = tcp:send(data, first+1, last)
+ -- if we are done, or there was an unexpected error,
+ -- break away from loop
+ if error ~= "timeout" then return result, error, first end
+ end
+ end
+ -- receive in non-blocking mode and yield on timeout
+ -- or simply return partial read, if user requested timeout = 0
+ function wrap:receive(pattern, partial)
+ local error = "timeout"
+ local value
+ while true do
+ -- return control to dispatcher and tell it we want to receive
+ -- if upon return the dispatcher tells us we timed out,
+ -- return an error to whoever called us
+ if coroutine.yield(dispatcher.receiving, tcp) == "timeout" then
+ return nil, "timeout"
+ end
+ -- try receiving
+ value, error, partial = tcp:receive(pattern, partial)
+ -- if we are done, or there was an unexpected error,
+ -- break away from loop. also, if the user requested
+ -- zero timeout, return all we got
+ if (error ~= "timeout") or zero then
+ return value, error, partial
+ end
+ end
+ end
+ -- connect in non-blocking mode and yield on timeout
+ function wrap:connect(host, port)
+ local result, error = tcp:connect(host, port)
+ if error == "timeout" then
+ -- return control to dispatcher. we will be writable when
+ -- connection succeeds.
+ -- if upon return the dispatcher tells us we have a
+ -- timeout, just abort
+ if coroutine.yield(dispatcher.sending, tcp) == "timeout" then
+ return nil, "timeout"
+ end
+ -- when we come back, check if connection was successful
+ result, error = tcp:connect(host, port)
+ if result or error == "already connected" then return 1
+ else return nil, "non-blocking connect failed" end
+ else return result, error end
+ end
+ -- accept in non-blocking mode and yield on timeout
+ function wrap:accept()
+ while 1 do
+ -- return control to dispatcher. we will be readable when a
+ -- connection arrives.
+ -- if upon return the dispatcher tells us we have a
+ -- timeout, just abort
+ if coroutine.yield(dispatcher.receiving, tcp) == "timeout" then
+ return nil, "timeout"
+ end
+ local client, error = tcp:accept()
+ if error ~= "timeout" then
+ return cowrap(dispatcher, client, error)
+ end
+ end
+ end
+ -- remove cortn from context
+ function wrap:close()
+ dispatcher.stamp[tcp] = nil
+ dispatcher.sending.set:remove(tcp)
+ dispatcher.sending.cortn[tcp] = nil
+ dispatcher.receiving.set:remove(tcp)
+ dispatcher.receiving.cortn[tcp] = nil
+ return tcp:close()
+ end
+ return base.setmetatable(wrap, metat)
+end
+
+
+-----------------------------------------------------------------------------
+-- Our coroutine dispatcher
+-----------------------------------------------------------------------------
+local cometat = { __index = {} }
+
+function schedule(cortn, status, operation, tcp)
+ if status then
+ if cortn and operation then
+ operation.set:insert(tcp)
+ operation.cortn[tcp] = cortn
+ operation.stamp[tcp] = socket.gettime()
+ end
+ else base.error(operation) end
+end
+
+function kick(operation, tcp)
+ operation.cortn[tcp] = nil
+ operation.set:remove(tcp)
+end
+
+function wakeup(operation, tcp)
+ local cortn = operation.cortn[tcp]
+ -- if cortn is still valid, wake it up
+ if cortn then
+ kick(operation, tcp)
+ return cortn, coroutine.resume(cortn)
+ -- othrewise, just get scheduler not to do anything
+ else
+ return nil, true
+ end
+end
+
+function abort(operation, tcp)
+ local cortn = operation.cortn[tcp]
+ if cortn then
+ kick(operation, tcp)
+ coroutine.resume(cortn, "timeout")
+ end
+end
+
+-- step through all active cortns
+function cometat.__index:step()
+ -- check which sockets are interesting and act on them
+ local readable, writable = socket.select(self.receiving.set,
+ self.sending.set, 1)
+ -- for all readable connections, resume their cortns and reschedule
+ -- when they yield back to us
+ for _, tcp in base.ipairs(readable) do
+ schedule(wakeup(self.receiving, tcp))
+ end
+ -- for all writable connections, do the same
+ for _, tcp in base.ipairs(writable) do
+ schedule(wakeup(self.sending, tcp))
+ end
+ -- politely ask replacement I/O functions in idle cortns to
+ -- return reporting a timeout
+ local now = socket.gettime()
+ for tcp, stamp in base.pairs(self.stamp) do
+ if tcp.class == "tcp{client}" and now - stamp > TIMEOUT then
+ abort(self.sending, tcp)
+ abort(self.receiving, tcp)
+ end
+ end
+end
+
+function cometat.__index:start(func)
+ local cortn = coroutine.create(func)
+ schedule(cortn, coroutine.resume(cortn))
+end
+
+function handlert.coroutine()
+ local stamp = {}
+ local dispatcher = {
+ stamp = stamp,
+ sending = {
+ name = "sending",
+ set = newset(),
+ cortn = {},
+ stamp = stamp
+ },
+ receiving = {
+ name = "receiving",
+ set = newset(),
+ cortn = {},
+ stamp = stamp
+ },
+ }
+ function dispatcher.tcp()
+ return cowrap(dispatcher, socket.tcp())
+ end
+ return base.setmetatable(dispatcher, cometat)
+end
+
diff --git a/etc/eol.lua b/etc/eol.lua
new file mode 100644
index 0000000..eeaf0ce
--- /dev/null
+++ b/etc/eol.lua
@@ -0,0 +1,13 @@
+-----------------------------------------------------------------------------
+-- Little program to adjust end of line markers.
+-- LuaSocket sample files
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+local mime = require("mime")
+local ltn12 = require("ltn12")
+local marker = '\n'
+if arg and arg[1] == '-d' then marker = '\r\n' end
+local filter = mime.normalize(marker)
+local source = ltn12.source.chain(ltn12.source.file(io.stdin), filter)
+local sink = ltn12.sink.file(io.stdout)
+ltn12.pump.all(source, sink)
diff --git a/etc/forward.lua b/etc/forward.lua
new file mode 100644
index 0000000..05ced1a
--- /dev/null
+++ b/etc/forward.lua
@@ -0,0 +1,65 @@
+-- load our favourite library
+local dispatch = require("dispatch")
+local handler = dispatch.newhandler()
+
+-- make sure the user knows how to invoke us
+if #arg < 1 then
+ print("Usage")
+ print(" lua forward.lua ...")
+ os.exit(1)
+end
+
+-- function to move data from one socket to the other
+local function move(foo, bar)
+ local live
+ while 1 do
+ local data, error, partial = foo:receive(2048)
+ live = data or error == "timeout"
+ data = data or partial
+ local result, error = bar:send(data)
+ if not live or not result then
+ foo:close()
+ bar:close()
+ break
+ end
+ end
+end
+
+-- for each tunnel, start a new server
+for i, v in ipairs(arg) do
+ -- capture forwarding parameters
+ local _, _, iport, ohost, oport = string.find(v, "([^:]+):([^:]+):([^:]+)")
+ assert(iport, "invalid arguments")
+ -- create our server socket
+ local server = assert(handler.tcp())
+ assert(server:setoption("reuseaddr", true))
+ assert(server:bind("*", iport))
+ assert(server:listen(32))
+ -- handler for the server object loops accepting new connections
+ handler:start(function()
+ while 1 do
+ local client = assert(server:accept())
+ assert(client:settimeout(0))
+ -- for each new connection, start a new client handler
+ handler:start(function()
+ -- handler tries to connect to peer
+ local peer = assert(handler.tcp())
+ assert(peer:settimeout(0))
+ assert(peer:connect(ohost, oport))
+ -- if sucessful, starts a new handler to send data from
+ -- client to peer
+ handler:start(function()
+ move(client, peer)
+ end)
+ -- afte starting new handler, enter in loop sending data from
+ -- peer to client
+ move(peer, client)
+ end)
+ end
+ end)
+end
+
+-- simply loop stepping the server
+while 1 do
+ handler:step()
+end
diff --git a/etc/get.lua b/etc/get.lua
new file mode 100644
index 0000000..9edc235
--- /dev/null
+++ b/etc/get.lua
@@ -0,0 +1,141 @@
+-----------------------------------------------------------------------------
+-- Little program to download files from URLs
+-- LuaSocket sample files
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+local socket = require("socket")
+local http = require("socket.http")
+local ftp = require("socket.ftp")
+local url = require("socket.url")
+local ltn12 = require("ltn12")
+
+-- formats a number of seconds into human readable form
+function nicetime(s)
+ local l = "s"
+ if s > 60 then
+ s = s / 60
+ l = "m"
+ if s > 60 then
+ s = s / 60
+ l = "h"
+ if s > 24 then
+ s = s / 24
+ l = "d" -- hmmm
+ end
+ end
+ end
+ if l == "s" then return string.format("%5.0f%s", s, l)
+ else return string.format("%5.2f%s", s, l) end
+end
+
+-- formats a number of bytes into human readable form
+function nicesize(b)
+ local l = "B"
+ if b > 1024 then
+ b = b / 1024
+ l = "KB"
+ if b > 1024 then
+ b = b / 1024
+ l = "MB"
+ if b > 1024 then
+ b = b / 1024
+ l = "GB" -- hmmm
+ end
+ end
+ end
+ return string.format("%7.2f%2s", b, l)
+end
+
+-- returns a string with the current state of the download
+local remaining_s = "%s received, %s/s throughput, %2.0f%% done, %s remaining"
+local elapsed_s = "%s received, %s/s throughput, %s elapsed "
+function gauge(got, delta, size)
+ local rate = got / delta
+ if size and size >= 1 then
+ return string.format(remaining_s, nicesize(got), nicesize(rate),
+ 100*got/size, nicetime((size-got)/rate))
+ else
+ return string.format(elapsed_s, nicesize(got),
+ nicesize(rate), nicetime(delta))
+ end
+end
+
+-- creates a new instance of a receive_cb that saves to disk
+-- kind of copied from luasocket's manual callback examples
+function stats(size)
+ local start = socket.gettime()
+ local last = start
+ local got = 0
+ return function(chunk)
+ -- elapsed time since start
+ local current = socket.gettime()
+ if chunk then
+ -- total bytes received
+ got = got + string.len(chunk)
+ -- not enough time for estimate
+ if current - last > 1 then
+ io.stderr:write("\r", gauge(got, current - start, size))
+ io.stderr:flush()
+ last = current
+ end
+ else
+ -- close up
+ io.stderr:write("\r", gauge(got, current - start), "\n")
+ end
+ return chunk
+ end
+end
+
+-- determines the size of a http file
+function gethttpsize(u)
+ local r, c, h = http.request {method = "HEAD", url = u}
+ if c == 200 then
+ return tonumber(h["content-length"])
+ end
+end
+
+-- downloads a file using the http protocol
+function getbyhttp(u, file)
+ local save = ltn12.sink.file(file or io.stdout)
+ -- only print feedback if output is not stdout
+ if file then save = ltn12.sink.chain(stats(gethttpsize(u)), save) end
+ local r, c, h, s = http.request {url = u, sink = save }
+ if c ~= 200 then io.stderr:write(s or c, "\n") end
+end
+
+-- downloads a file using the ftp protocol
+function getbyftp(u, file)
+ local save = ltn12.sink.file(file or io.stdout)
+ -- only print feedback if output is not stdout
+ -- and we don't know how big the file is
+ if file then save = ltn12.sink.chain(stats(), save) end
+ local gett = url.parse(u)
+ gett.sink = save
+ gett.type = "i"
+ local ret, err = ftp.get(gett)
+ if err then print(err) end
+end
+
+-- determines the scheme
+function getscheme(u)
+ -- this is an heuristic to solve a common invalid url poblem
+ if not string.find(u, "//") then u = "//" .. u end
+ local parsed = url.parse(u, {scheme = "http"})
+ return parsed.scheme
+end
+
+-- gets a file either by http or ftp, saving as
+function get(u, name)
+ local fout = name and io.open(name, "wb")
+ local scheme = getscheme(u)
+ if scheme == "ftp" then getbyftp(u, fout)
+ elseif scheme == "http" then getbyhttp(u, fout)
+ else print("unknown scheme" .. scheme) end
+end
+
+-- main program
+arg = arg or {}
+if #arg < 1 then
+ io.write("Usage:\n lua get.lua []\n")
+ os.exit(1)
+else get(arg[1], arg[2]) end
diff --git a/etc/links b/etc/links
new file mode 100644
index 0000000..087f1c0
--- /dev/null
+++ b/etc/links
@@ -0,0 +1,17 @@
+ bla
+ bla
+ bla
+ bla
+ bla
+ bla
+ bla
+ bla
+ bla
+ bla
+ bla
+ bla
+ bla
+ bla
+ bla
+ bla
+ bla
diff --git a/etc/lp.lua b/etc/lp.lua
new file mode 100644
index 0000000..25f0b95
--- /dev/null
+++ b/etc/lp.lua
@@ -0,0 +1,323 @@
+-----------------------------------------------------------------------------
+-- LPD support for the Lua language
+-- LuaSocket toolkit.
+-- Author: David Burgess
+-- Modified by Diego Nehab, but David is in charge
+-----------------------------------------------------------------------------
+--[[
+ if you have any questions: RFC 1179
+]]
+-- make sure LuaSocket is loaded
+local io = require("io")
+local base = _G
+local os = require("os")
+local math = require("math")
+local string = require("string")
+local socket = require("socket")
+local ltn12 = require("ltn12")
+module("socket.lp")
+
+-- default port
+PORT = 515
+SERVER = os.getenv("SERVER_NAME") or os.getenv("COMPUTERNAME") or "localhost"
+PRINTER = os.getenv("PRINTER") or "printer"
+
+local function connect(localhost, option)
+ local host = option.host or SERVER
+ local port = option.port or PORT
+ local skt
+ local try = socket.newtry(function() if skt then skt:close() end end)
+ if option.localbind then
+ -- bind to a local port (if we can)
+ local localport = 721
+ local done, err
+ repeat
+ skt = socket.try(socket.tcp())
+ try(skt:settimeout(30))
+ done, err = skt:bind(localhost, localport)
+ if not done then
+ localport = localport + 1
+ skt:close()
+ skt = nil
+ else break end
+ until localport > 731
+ socket.try(skt, err)
+ else skt = socket.try(socket.tcp()) end
+ try(skt:connect(host, port))
+ return { skt = skt, try = try }
+end
+
+--[[
+RFC 1179
+5.3 03 - Send queue state (short)
+
+ +----+-------+----+------+----+
+ | 03 | Queue | SP | List | LF |
+ +----+-------+----+------+----+
+ Command code - 3
+ Operand 1 - Printer queue name
+ Other operands - User names or job numbers
+
+ If the user names or job numbers or both are supplied then only those
+ jobs for those users or with those numbers will be sent.
+
+ The response is an ASCII stream which describes the printer queue.
+ The stream continues until the connection closes. Ends of lines are
+ indicated with ASCII LF control characters. The lines may also
+ contain ASCII HT control characters.
+
+5.4 04 - Send queue state (long)
+
+ +----+-------+----+------+----+
+ | 04 | Queue | SP | List | LF |
+ +----+-------+----+------+----+
+ Command code - 4
+ Operand 1 - Printer queue name
+ Other operands - User names or job numbers
+
+ If the user names or job numbers or both are supplied then only those
+ jobs for those users or with those numbers will be sent.
+
+ The response is an ASCII stream which describes the printer queue.
+ The stream continues until the connection closes. Ends of lines are
+ indicated with ASCII LF control characters. The lines may also
+ contain ASCII HT control characters.
+]]
+
+-- gets server acknowledement
+local function recv_ack(con)
+ local ack = con.skt:receive(1)
+ con.try(string.char(0) == ack, "failed to receive server acknowledgement")
+end
+
+-- sends client acknowledement
+local function send_ack(con)
+ local sent = con.skt:send(string.char(0))
+ con.try(sent == 1, "failed to send acknowledgement")
+end
+
+-- sends queue request
+-- 5.2 02 - Receive a printer job
+--
+-- +----+-------+----+
+-- | 02 | Queue | LF |
+-- +----+-------+----+
+-- Command code - 2
+-- Operand - Printer queue name
+--
+-- Receiving a job is controlled by a second level of commands. The
+-- daemon is given commands by sending them over the same connection.
+-- The commands are described in the next section (6).
+--
+-- After this command is sent, the client must read an acknowledgement
+-- octet from the daemon. A positive acknowledgement is an octet of
+-- zero bits. A negative acknowledgement is an octet of any other
+-- pattern.
+local function send_queue(con, queue)
+ queue = queue or PRINTER
+ local str = string.format("\2%s\10", queue)
+ local sent = con.skt:send(str)
+ con.try(sent == string.len(str), "failed to send print request")
+ recv_ack(con)
+end
+
+-- sends control file
+-- 6.2 02 - Receive control file
+--
+-- +----+-------+----+------+----+
+-- | 02 | Count | SP | Name | LF |
+-- +----+-------+----+------+----+
+-- Command code - 2
+-- Operand 1 - Number of bytes in control file
+-- Operand 2 - Name of control file
+--
+-- The control file must be an ASCII stream with the ends of lines
+-- indicated by ASCII LF. The total number of bytes in the stream is
+-- sent as the first operand. The name of the control file is sent as
+-- the second. It should start with ASCII "cfA", followed by a three
+-- digit job number, followed by the host name which has constructed the
+-- control file. Acknowledgement processing must occur as usual after
+-- the command is sent.
+--
+-- The next "Operand 1" octets over the same TCP connection are the
+-- intended contents of the control file. Once all of the contents have
+-- been delivered, an octet of zero bits is sent as an indication that
+-- the file being sent is complete. A second level of acknowledgement
+-- processing must occur at this point.
+
+-- sends data file
+-- 6.3 03 - Receive data file
+--
+-- +----+-------+----+------+----+
+-- | 03 | Count | SP | Name | LF |
+-- +----+-------+----+------+----+
+-- Command code - 3
+-- Operand 1 - Number of bytes in data file
+-- Operand 2 - Name of data file
+--
+-- The data file may contain any 8 bit values at all. The total number
+-- of bytes in the stream may be sent as the first operand, otherwise
+-- the field should be cleared to 0. The name of the data file should
+-- start with ASCII "dfA". This should be followed by a three digit job
+-- number. The job number should be followed by the host name which has
+-- constructed the data file. Interpretation of the contents of the
+-- data file is determined by the contents of the corresponding control
+-- file. If a data file length has been specified, the next "Operand 1"
+-- octets over the same TCP connection are the intended contents of the
+-- data file. In this case, once all of the contents have been
+-- delivered, an octet of zero bits is sent as an indication that the
+-- file being sent is complete. A second level of acknowledgement
+-- processing must occur at this point.
+
+
+local function send_hdr(con, control)
+ local sent = con.skt:send(control)
+ con.try(sent and sent >= 1 , "failed to send header file")
+ recv_ack(con)
+end
+
+local function send_control(con, control)
+ local sent = con.skt:send(control)
+ con.try(sent and sent >= 1, "failed to send control file")
+ send_ack(con)
+end
+
+local function send_data(con,fh,size)
+ local buf
+ while size > 0 do
+ buf,message = fh:read(8192)
+ if buf then
+ st = con.try(con.skt:send(buf))
+ size = size - st
+ else
+ con.try(size == 0, "file size mismatch")
+ end
+ end
+ recv_ack(con) -- note the double acknowledgement
+ send_ack(con)
+ recv_ack(con)
+ return size
+end
+
+
+--[[
+local control_dflt = {
+ "H"..string.sub(socket.hostname,1,31).."\10", -- host
+ "C"..string.sub(socket.hostname,1,31).."\10", -- class
+ "J"..string.sub(filename,1,99).."\10", -- jobname
+ "L"..string.sub(user,1,31).."\10", -- print banner page
+ "I"..tonumber(indent).."\10", -- indent column count ('f' only)
+ "M"..string.sub(mail,1,128).."\10", -- mail when printed user@host
+ "N"..string.sub(filename,1,131).."\10", -- name of source file
+ "P"..string.sub(user,1,31).."\10", -- user name
+ "T"..string.sub(title,1,79).."\10", -- title for banner ('p' only)
+ "W"..tonumber(width or 132).."\10", -- width of print f,l,p only
+
+ "f"..file.."\10", -- formatted print (remove control chars)
+ "l"..file.."\10", -- print
+ "o"..file.."\10", -- postscript
+ "p"..file.."\10", -- pr format - requires T, L
+ "r"..file.."\10", -- fortran format
+ "U"..file.."\10", -- Unlink (data file only)
+}
+]]
+
+-- generate a varying job number
+local seq = 0
+local function newjob(connection)
+ seq = seq + 1
+ return math.floor(socket.gettime() * 1000 + seq)%1000
+end
+
+
+local format_codes = {
+ binary = 'l',
+ text = 'f',
+ ps = 'o',
+ pr = 'p',
+ fortran = 'r',
+ l = 'l',
+ r = 'r',
+ o = 'o',
+ p = 'p',
+ f = 'f'
+}
+
+-- lp.send{option}
+-- requires option.file
+
+send = socket.protect(function(option)
+ socket.try(option and base.type(option) == "table", "invalid options")
+ local file = option.file
+ socket.try(file, "invalid file name")
+ local fh = socket.try(io.open(file,"rb"))
+ local datafile_size = fh:seek("end") -- get total size
+ fh:seek("set") -- go back to start of file
+ local localhost = socket.dns.gethostname() or os.getenv("COMPUTERNAME")
+ or "localhost"
+ local con = connect(localhost, option)
+-- format the control file
+ local jobno = newjob()
+ local localip = socket.dns.toip(localhost)
+ localhost = string.sub(localhost,1,31)
+ local user = string.sub(option.user or os.getenv("LPRUSER") or
+ os.getenv("USERNAME") or os.getenv("USER") or "anonymous", 1,31)
+ local lpfile = string.format("dfA%3.3d%-s", jobno, localhost);
+ local fmt = format_codes[option.format] or 'l'
+ local class = string.sub(option.class or localip or localhost,1,31)
+ local _,_,ctlfn = string.find(file,".*[%/%\\](.*)")
+ ctlfn = string.sub(ctlfn or file,1,131)
+ local cfile =
+ string.format("H%-s\nC%-s\nJ%-s\nP%-s\n%.1s%-s\nU%-s\nN%-s\n",
+ localhost,
+ class,
+ option.job or "LuaSocket",
+ user,
+ fmt, lpfile,
+ lpfile,
+ ctlfn); -- mandatory part of ctl file
+ if (option.banner) then cfile = cfile .. 'L'..user..'\10' end
+ if (option.indent) then cfile = cfile .. 'I'..base.tonumber(option.indent)..'\10' end
+ if (option.mail) then cfile = cfile .. 'M'..string.sub((option.mail),1,128)..'\10' end
+ if (fmt == 'p' and option.title) then cfile = cfile .. 'T'..string.sub((option.title),1,79)..'\10' end
+ if ((fmt == 'p' or fmt == 'l' or fmt == 'f') and option.width) then
+ cfile = cfile .. 'W'..base.tonumber(option,width)..'\10'
+ end
+
+ con.skt:settimeout(option.timeout or 65)
+-- send the queue header
+ send_queue(con, option.queue)
+-- send the control file header
+ local cfilecmd = string.format("\2%d cfA%3.3d%-s\n",string.len(cfile), jobno, localhost);
+ send_hdr(con,cfilecmd)
+
+-- send the control file
+ send_control(con,cfile)
+
+-- send the data file header
+ local dfilecmd = string.format("\3%d dfA%3.3d%-s\n",datafile_size, jobno, localhost);
+ send_hdr(con,dfilecmd)
+
+-- send the data file
+ send_data(con,fh,datafile_size)
+ fh:close()
+ con.skt:close();
+ return jobno, datafile_size
+end)
+
+--
+-- lp.query({host=,queue=printer|'*', format='l'|'s', list=})
+--
+query = socket.protect(function(p)
+ p = p or {}
+ local localhost = socket.dns.gethostname() or os.getenv("COMPUTERNAME")
+ or "localhost"
+ local con = connect(localhost,p)
+ local fmt
+ if string.sub(p.format or 's',1,1) == 's' then fmt = 3 else fmt = 4 end
+ con.try(con.skt:send(string.format("%c%s %s\n", fmt, p.queue or "*",
+ p.list or "")))
+ local data = con.try(con.skt:receive("*a"))
+ con.skt:close()
+ return data
+end)
diff --git a/etc/qp.lua b/etc/qp.lua
new file mode 100644
index 0000000..523238b
--- /dev/null
+++ b/etc/qp.lua
@@ -0,0 +1,23 @@
+-----------------------------------------------------------------------------
+-- Little program to convert to and from Quoted-Printable
+-- LuaSocket sample files
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+local ltn12 = require("ltn12")
+local mime = require("mime")
+local convert
+arg = arg or {}
+local mode = arg and arg[1] or "-et"
+if mode == "-et" then
+ local normalize = mime.normalize()
+ local qp = mime.encode("quoted-printable")
+ local wrap = mime.wrap("quoted-printable")
+ convert = ltn12.filter.chain(normalize, qp, wrap)
+elseif mode == "-eb" then
+ local qp = mime.encode("quoted-printable", "binary")
+ local wrap = mime.wrap("quoted-printable")
+ convert = ltn12.filter.chain(qp, wrap)
+else convert = mime.decode("quoted-printable") end
+local source = ltn12.source.chain(ltn12.source.file(io.stdin), convert)
+local sink = ltn12.sink.file(io.stdout)
+ltn12.pump.all(source, sink)
diff --git a/etc/tftp.lua b/etc/tftp.lua
new file mode 100644
index 0000000..ed99cd1
--- /dev/null
+++ b/etc/tftp.lua
@@ -0,0 +1,154 @@
+-----------------------------------------------------------------------------
+-- TFTP support for the Lua language
+-- LuaSocket toolkit.
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+
+-----------------------------------------------------------------------------
+-- Load required files
+-----------------------------------------------------------------------------
+local base = _G
+local table = require("table")
+local math = require("math")
+local string = require("string")
+local socket = require("socket")
+local ltn12 = require("ltn12")
+local url = require("socket.url")
+module("socket.tftp")
+
+-----------------------------------------------------------------------------
+-- Program constants
+-----------------------------------------------------------------------------
+local char = string.char
+local byte = string.byte
+
+PORT = 69
+local OP_RRQ = 1
+local OP_WRQ = 2
+local OP_DATA = 3
+local OP_ACK = 4
+local OP_ERROR = 5
+local OP_INV = {"RRQ", "WRQ", "DATA", "ACK", "ERROR"}
+
+-----------------------------------------------------------------------------
+-- Packet creation functions
+-----------------------------------------------------------------------------
+local function RRQ(source, mode)
+ return char(0, OP_RRQ) .. source .. char(0) .. mode .. char(0)
+end
+
+local function WRQ(source, mode)
+ return char(0, OP_RRQ) .. source .. char(0) .. mode .. char(0)
+end
+
+local function ACK(block)
+ local low, high
+ low = math.mod(block, 256)
+ high = (block - low)/256
+ return char(0, OP_ACK, high, low)
+end
+
+local function get_OP(dgram)
+ local op = byte(dgram, 1)*256 + byte(dgram, 2)
+ return op
+end
+
+-----------------------------------------------------------------------------
+-- Packet analysis functions
+-----------------------------------------------------------------------------
+local function split_DATA(dgram)
+ local block = byte(dgram, 3)*256 + byte(dgram, 4)
+ local data = string.sub(dgram, 5)
+ return block, data
+end
+
+local function get_ERROR(dgram)
+ local code = byte(dgram, 3)*256 + byte(dgram, 4)
+ local msg
+ _,_, msg = string.find(dgram, "(.*)\000", 5)
+ return string.format("error code %d: %s", code, msg)
+end
+
+-----------------------------------------------------------------------------
+-- The real work
+-----------------------------------------------------------------------------
+local function tget(gett)
+ local retries, dgram, sent, datahost, dataport, code
+ local last = 0
+ socket.try(gett.host, "missing host")
+ local con = socket.try(socket.udp())
+ local try = socket.newtry(function() con:close() end)
+ -- convert from name to ip if needed
+ gett.host = try(socket.dns.toip(gett.host))
+ con:settimeout(1)
+ -- first packet gives data host/port to be used for data transfers
+ local path = string.gsub(gett.path or "", "^/", "")
+ path = url.unescape(path)
+ retries = 0
+ repeat
+ sent = try(con:sendto(RRQ(path, "octet"), gett.host, gett.port))
+ dgram, datahost, dataport = con:receivefrom()
+ retries = retries + 1
+ until dgram or datahost ~= "timeout" or retries > 5
+ try(dgram, datahost)
+ -- associate socket with data host/port
+ try(con:setpeername(datahost, dataport))
+ -- default sink
+ local sink = gett.sink or ltn12.sink.null()
+ -- process all data packets
+ while 1 do
+ -- decode packet
+ code = get_OP(dgram)
+ try(code ~= OP_ERROR, get_ERROR(dgram))
+ try(code == OP_DATA, "unhandled opcode " .. code)
+ -- get data packet parts
+ local block, data = split_DATA(dgram)
+ -- if not repeated, write
+ if block == last+1 then
+ try(sink(data))
+ last = block
+ end
+ -- last packet brings less than 512 bytes of data
+ if string.len(data) < 512 then
+ try(con:send(ACK(block)))
+ try(con:close())
+ try(sink(nil))
+ return 1
+ end
+ -- get the next packet
+ retries = 0
+ repeat
+ sent = try(con:send(ACK(last)))
+ dgram, err = con:receive()
+ retries = retries + 1
+ until dgram or err ~= "timeout" or retries > 5
+ try(dgram, err)
+ end
+end
+
+local default = {
+ port = PORT,
+ path ="/",
+ scheme = "tftp"
+}
+
+local function parse(u)
+ local t = socket.try(url.parse(u, default))
+ socket.try(t.scheme == "tftp", "invalid scheme '" .. t.scheme .. "'")
+ socket.try(t.host, "invalid host")
+ return t
+end
+
+local function sget(u)
+ local gett = parse(u)
+ local t = {}
+ gett.sink = ltn12.sink.table(t)
+ tget(gett)
+ return table.concat(t)
+end
+
+get = socket.protect(function(gett)
+ if base.type(gett) == "string" then return sget(gett)
+ else return tget(gett) end
+end)
+
diff --git a/gem/ex1.lua b/gem/ex1.lua
new file mode 100644
index 0000000..327a542
--- /dev/null
+++ b/gem/ex1.lua
@@ -0,0 +1,4 @@
+local CRLF = "\013\010"
+local input = source.chain(source.file(io.stdin), normalize(CRLF))
+local output = sink.file(io.stdout)
+pump.all(input, output)
diff --git a/gem/ex10.lua b/gem/ex10.lua
new file mode 100644
index 0000000..2b1b98f
--- /dev/null
+++ b/gem/ex10.lua
@@ -0,0 +1,17 @@
+function pump.step(src, snk)
+ local chunk, src_err = src()
+ local ret, snk_err = snk(chunk, src_err)
+ if chunk and ret then return 1
+ else return nil, src_err or snk_err end
+end
+
+function pump.all(src, snk, step)
+ step = step or pump.step
+ while true do
+ local ret, err = step(src, snk)
+ if not ret then
+ if err then return nil, err
+ else return 1 end
+ end
+ end
+end
diff --git a/gem/ex11.lua b/gem/ex11.lua
new file mode 100644
index 0000000..1cbf01f
--- /dev/null
+++ b/gem/ex11.lua
@@ -0,0 +1,7 @@
+local input = source.chain(
+ source.file(io.open("input.bin", "rb")),
+ encode("base64"))
+local output = sink.chain(
+ wrap(76),
+ sink.file(io.open("output.b64", "w")))
+pump.all(input, output)
diff --git a/gem/ex12.lua b/gem/ex12.lua
new file mode 100644
index 0000000..de17d76
--- /dev/null
+++ b/gem/ex12.lua
@@ -0,0 +1,34 @@
+local smtp = require"socket.smtp"
+local mime = require"mime"
+local ltn12 = require"ltn12"
+
+CRLF = "\013\010"
+
+local message = smtp.message{
+ headers = {
+ from = "Sicrano ",
+ to = "Fulano ",
+ subject = "A message with an attachment"},
+ body = {
+ preamble = "Hope you can see the attachment" .. CRLF,
+ [1] = {
+ body = "Here is our logo" .. CRLF},
+ [2] = {
+ headers = {
+ ["content-type"] = 'image/png; name="luasocket.png"',
+ ["content-disposition"] =
+ 'attachment; filename="luasocket.png"',
+ ["content-description"] = 'LuaSocket logo',
+ ["content-transfer-encoding"] = "BASE64"},
+ body = ltn12.source.chain(
+ ltn12.source.file(io.open("luasocket.png", "rb")),
+ ltn12.filter.chain(
+ mime.encode("base64"),
+ mime.wrap()))}}}
+
+assert(smtp.send{
+ rcpt = "",
+ from = "",
+ server = "localhost",
+ port = 2525,
+ source = message})
diff --git a/gem/ex2.lua b/gem/ex2.lua
new file mode 100644
index 0000000..94bde66
--- /dev/null
+++ b/gem/ex2.lua
@@ -0,0 +1,11 @@
+function filter.cycle(lowlevel, context, extra)
+ return function(chunk)
+ local ret
+ ret, context = lowlevel(context, chunk, extra)
+ return ret
+ end
+end
+
+function normalize(marker)
+ return filter.cycle(eol, 0, marker)
+end
diff --git a/gem/ex3.lua b/gem/ex3.lua
new file mode 100644
index 0000000..a43fefa
--- /dev/null
+++ b/gem/ex3.lua
@@ -0,0 +1,15 @@
+local function chainpair(f1, f2)
+ return function(chunk)
+ local ret = f2(f1(chunk))
+ if chunk then return ret
+ else return (ret or "") .. (f2() or "") end
+ end
+end
+
+function filter.chain(...)
+ local f = select(1, ...)
+ for i = 2, select('#', ...) do
+ f = chainpair(f, select(i, ...))
+ end
+ return f
+end
diff --git a/gem/ex4.lua b/gem/ex4.lua
new file mode 100644
index 0000000..c670e0e
--- /dev/null
+++ b/gem/ex4.lua
@@ -0,0 +1,5 @@
+local qp = filter.chain(normalize(CRLF), encode("quoted-printable"),
+ wrap("quoted-printable"))
+local input = source.chain(source.file(io.stdin), qp)
+local output = sink.file(io.stdout)
+pump.all(input, output)
diff --git a/gem/ex5.lua b/gem/ex5.lua
new file mode 100644
index 0000000..196b30a
--- /dev/null
+++ b/gem/ex5.lua
@@ -0,0 +1,15 @@
+function source.empty(err)
+ return function()
+ return nil, err
+ end
+end
+
+function source.file(handle, io_err)
+ if handle then
+ return function()
+ local chunk = handle:read(20)
+ if not chunk then handle:close() end
+ return chunk
+ end
+ else return source.empty(io_err or "unable to open file") end
+end
diff --git a/gem/ex6.lua b/gem/ex6.lua
new file mode 100644
index 0000000..a3fdca0
--- /dev/null
+++ b/gem/ex6.lua
@@ -0,0 +1,14 @@
+function source.chain(src, f)
+ return function()
+ if not src then
+ return nil
+ end
+ local chunk, err = src()
+ if not chunk then
+ src = nil
+ return f(nil)
+ else
+ return f(chunk)
+ end
+ end
+end
diff --git a/gem/ex7.lua b/gem/ex7.lua
new file mode 100644
index 0000000..c766988
--- /dev/null
+++ b/gem/ex7.lua
@@ -0,0 +1,16 @@
+function sink.table(t)
+ t = t or {}
+ local f = function(chunk, err)
+ if chunk then table.insert(t, chunk) end
+ return 1
+ end
+ return f, t
+end
+
+local function null()
+ return 1
+end
+
+function sink.null()
+ return null
+end
diff --git a/gem/ex8.lua b/gem/ex8.lua
new file mode 100644
index 0000000..81e288c
--- /dev/null
+++ b/gem/ex8.lua
@@ -0,0 +1,5 @@
+local input = source.file(io.stdin)
+local output, t = sink.table()
+output = sink.chain(normalize(CRLF), output)
+pump.all(input, output)
+io.write(table.concat(t))
diff --git a/gem/ex9.lua b/gem/ex9.lua
new file mode 100644
index 0000000..b857698
--- /dev/null
+++ b/gem/ex9.lua
@@ -0,0 +1,3 @@
+for chunk in source.file(io.stdin) do
+ io.write(chunk)
+end
diff --git a/gem/gem.c b/gem/gem.c
new file mode 100644
index 0000000..976f74d
--- /dev/null
+++ b/gem/gem.c
@@ -0,0 +1,54 @@
+#include "lua.h"
+#include "lauxlib.h"
+
+#define CR '\xD'
+#define LF '\xA'
+#define CRLF "\xD\xA"
+
+#define candidate(c) (c == CR || c == LF)
+static int pushchar(int c, int last, const char *marker,
+ luaL_Buffer *buffer) {
+ if (candidate(c)) {
+ if (candidate(last)) {
+ if (c == last)
+ luaL_addstring(buffer, marker);
+ return 0;
+ } else {
+ luaL_addstring(buffer, marker);
+ return c;
+ }
+ } else {
+ luaL_putchar(buffer, c);
+ return 0;
+ }
+}
+
+static int eol(lua_State *L) {
+ int context = luaL_checkint(L, 1);
+ size_t isize = 0;
+ const char *input = luaL_optlstring(L, 2, NULL, &isize);
+ const char *last = input + isize;
+ const char *marker = luaL_optstring(L, 3, CRLF);
+ luaL_Buffer buffer;
+ luaL_buffinit(L, &buffer);
+ if (!input) {
+ lua_pushnil(L);
+ lua_pushnumber(L, 0);
+ return 2;
+ }
+ while (input < last)
+ context = pushchar(*input++, context, marker, &buffer);
+ luaL_pushresult(&buffer);
+ lua_pushnumber(L, context);
+ return 2;
+}
+
+static luaL_reg func[] = {
+ { "eol", eol },
+ { NULL, NULL }
+};
+
+int luaopen_gem(lua_State *L) {
+ luaL_openlib(L, "gem", func, 0);
+ return 0;
+}
diff --git a/gem/gt.b64 b/gem/gt.b64
new file mode 100644
index 0000000..a74c0b3
--- /dev/null
+++ b/gem/gt.b64
@@ -0,0 +1,206 @@
+iVBORw0KGgoAAAANSUhEUgAAAIAAAACACAIAAABMXPacAAAtU0lEQVR42u19eXRURdb4rarXa5LO
+RshKEshC2MLOBIjsCoMLGJhRPnUEcUGZEX7j4Iw6zqd+zjkzzowL6gzKMOoBRHAAPyQKUZQlxLAk
+EIEkQkhCyEoISegs3f1eVf3+qPTj0Z3udEJImN/Pe/rkdF6/V6/q3qp7b92tEOccfoT+A9zfHfj/
+HX4kQD/DjwToZ/iRAP0MPxKgn+FHAvQz/EiAfgapvzvQQ3DfviCE+rtTPYH/AAKouEYIcc4ForUX
+tXeKexhj6k8IIe2DvdUl0SYAcN7RGYQ63oAQ4hx8fBu6BXfC6vBcsHyDeNRi7cYboZQjBIRgl/lB
+KQcAQnyl+q1IAC9YU7/s2bOnsrKSUupwOHQ63cMPP2wymRhjGOOrV6/m5ORYLJbg4OABAwZYLBaD
+waBtQUsD34mqRT0hHc/abEpNjbWlxYEQCgw0RET463QEABjjjHFfyND/LEg737XsQpblhoaGioqK
+CxcunD9/fv78+ampqepgZFk2mUwBAQEYY6PRSAhRG7Tb7cXFxXa73W63W63Wn/zkJ4sXL1YfVHGB
+EFI5VZc0EDcwxjnnkoRbWhw7dxZt316Yn19TW9siyxQADAZddHRAWlrMffeNnDcvUa8nlDKEAGNv
+7ffbClCnoYoFFRFiIufn53/88cfBwcERERERERHjxo2LjIz0ZbaqFLXb7ZcuXZIkKSoqShAYY7xn
+z576+vpJkybFxcUZjUZfOJKKfQBACP75z/yXXtpfXX0JAAFIAAQAAXAADsAAZAA0dGjMa6/Nueee
+FEoZQsgLDfqTAFqWIstyRUVFXFycJEniJ6vV2tTUFBUVRQhxkb0q2TTS7xr9tNxG/bdjtAjl5eXl
+5ubW1dUhhJKTkzMyMkwmk0p4AMAYq91Tv1DKCMENDW0PPLBj797vEdJjrAfgjF2HP+d8B8YcAMry
+5VP//vf5Oh3h3OM66P8V0NTU9N133+Xl5SmKsnr16qCgIBc8MsbE5HXXgjqdU9oRie8YY5c2W1tb
+CwsLS0tLFy5cqEoILWnFI84rHGNUXW29/fYPCwsvSpI/pQLxntYNxxhjDIpinTNn1K5d/2Uy6Zwd
+cNWO+o4A7mjFGOfk5OzcuTMsLGzixInjxo2zWCwqIlSpAL2k47tMc+18FN8vXLgAAHFxce4Cqa1N
+njlzw9GjZZLkryiK6KP3twEgnY7I8tWf/WzCtm33McZVJVV7H3nppZf6BvXaL+rAFEVJSEhYvHjx
+4MGDDQaDykxAw1h6S38XLxUcRnRGnXyiM4cOHdqyZUtDQ0N0dLSfn5/4SUz/Z57Zs3PnCZ0uQFEU
+ANQV9jvIwxiTJOPp0xdCQgLS0gZRyjF2Hc5NXwEu866lpUWv1+v1enVBqFsnwWS0dLrZ4K7dlpSU
+ZGZmVlVVpaen33PPPYL1HzlSOXnyewCk+6gSo2OhocaCgl9GR1vEOtCO7qbbglQsY4yPHj366quv
+nj59GjScWtBGq0f2mVHBZbVxzhMSElatWvXzn//cORUAANau/Y5zB8YYoLsUQJxzQqSGhqb1648D
+gFClXO+4eSNUZ9alS5e2b99eXl4+d+7cqVOnCrl361hvOt2LCNWlttY6bNjbTU22Hk9WhBDnjhEj
+IgoKVoqdc1+vAFmW//WvfymK8uyzz86aNUvlP72HPrjBWaR2RkgIoXeJ2ZqbW9nUdBVj0uPGOecA
+ujNn6s+cuQRui6CXd8JaJUedSsJUEBoaqtfrtdd9p4HQ3rTGL9UE1ik2BZ/trmnMRePinAFAQUEt
+AMMYuXMP34EQRKnjzJlLqakRLr3uTQJoJarLzigyMpIxJiStVr/0pTXOQdgAMEaEYACOEPb+tKCU
+UOEVhYq9qKCKTwYyzW0XL169cUaNEAJglZVXwc2Q3msE0GKfEFJYWGg2m+Pj41UtyMeJr8W7olCB
+dFVS2mxKZeXVqqqrFRXN9fVtDQ1tbW2yw0EBQK8nJpNuwABTWJjfoEGB0dEBMTEWk0mHEBYPU8oY
+Y04S+roEbTalt1Bkt1P3i728AjjnhJCjR49u3rw5IyNDEACcvBW8ajgqRhSFCUsvQhghVF/fmptb
+efjwxWPHqs6da6iutlLqAFA86yQIQCJEHxkZkJQUMnFi9JQpg9LSYsLD/THusCtw3mHR7JIMfn66
+3sKP2dxJU70sAzDGBw4c2Llz5/333z958mRVqfD+lBb1GCNhxa2oaP788x8++6z4yJFKq9UKQAGI
++CCkw1jvqVkhPylllZVXKivrv/22EID4+wdMmhS9YEHKggVD4+KCxAqjlHkig9DfASA+PkismO7r
+oNeAMQ6A4+ODwG0K9o4aqtoajx07tnnz5mXLlo0ePVplO12iXhjZMUYYI1mme/aUrF+f/9VXJTZb
+CwAG0GFMhDHLxfjlHQTTF/KTMQogAzCDwW/27ITHHhs/f36SXk+8GO4VhUkSzsoqmTv3XxgbbkQI
+A3BJQmfO/DI5eYAQhL1JAK0l68qVK1euXElMTOyS6av6EqViI4bb2+WNGwveeCO3uLgSAAAMhBCA
+Dh/TjQMhCABRSgHsAJCUFL16ddrDD4/289OrfQDNahBGiKYm2/Dha2tqrAj1YCcMAIAxYsw+aVLs
+kSMr3G2IN7QPcOqFXJ3IISEhCQkJvmBfaIeKIqQifPDBiREj3n3iiW3FxTUYmwgxCWT1FvYBgFJO
+KQVAhJgwNp07V7ty5afDh7+7fn0e50AIVhTGmNZiCIrCgoKMixYNB7D3aCcMTvalPPjgGNEHl597
+vgI8Gd8FL/JkLnaf+IcPV6xatScv7zxCEsYGdQd0k6HDvs2Yg3PH6NFD3npr3vTp8Wqv1D0Hxqik
+5MrYse+0tFCn48X3LSTHGDMmJySEnDjxy4AAfa+tAK1yWVpampubqxJDMLhOub9W2BKC29uVX/7y
+i/T09/LyygjxQ0hPKe0T7AMAYoxTShGSCPEvKKiYMWP9E0/sbm11iKXgHAIoCktMDHnxxVkAbTpd
+t9DFnahW/vSneQEBHYzOBS09IYA62THGra2tmzZtOnfunO9PCeF25Ejl+PHr3n13PyE6jI1O1Pex
+dQgxBpRSjA2E6N9//+DYseuysyskCVPKBTsiBDHGn302ffHiCbJs1ekkJ3K7GC5CSKfDlFrXrJm1
+ePFwShnGnYyuJwTQ+vk2bdrk5+e3ZMkS9Scv2GeMU8p1OvLOO0enTn3v7Nk6QvwpFQbRfjTMIcYY
+pZwQ/9LS+mnT3n/99e8kCQtmKNYB53zTpkV33jlGlpslSWzIPZFBhKUQjLksW596auZrr92hYt8d
+Pz1cAQKhmZmZpaWlS5culSRJsKNOJYrWqY0xeuKJz3/1q38DYIz1lIrNYT9gHyFXAxGlFGM9xtIz
+z+xctuwzYUESXnXOQacj//u/S3796zsUxU6pDSGQJEKIsHB0fAhBkkQQ4pS2Ygyvv77o3XfvFNjv
+zagIVZLs27cvMDBwwoQJqpHHE98Xno3WVvlnP9v65ZcFkhSgKKybAu0GgQMgse2iVIQviIFjjDHG
+YnvccZskYUWxzp49cseO+y0Wg+i82DFIEj58uOL55/cdPFgKYHfuDcUoGAAFYISY77572B//OGv4
+8DBFYd6jg3pIAE8hCF6w39xsu+uuTdnZZyXJv2+x34F6xhjndgAOoPfzM5nNEqXcarXLsg1AAdBh
+rIcOB5GgQcukSQlffPGL0FCTGIJgSmI65+VV79xZnJNzsby8UQ3MSkgImT49PiNjWHJyqBrC5d3u
+1A0CuHstvOv7KufBGFmtjnnzPsrJKZEkP0WhfTnxnV1t0+mMs2YlLVyYMnFiVHS0xWzWUcqammzn
+zl359tuyf/+7sKSkGiEJIT1jFAAkiShK68SJg7OylgYFGcVAAECrqiKEZJm2tysIgdmsc14EWRY2
+FY/q+A0RQG3Re2yIerMsszvv3Pj114WS5N/n2McACufKz38+/uWXZ6SkDHDvs4rH7duLXnjh69LS
+GkLMlHIALmgwbVry3r0PGwwd4T3gNDcJkqiUUC8SgjEWPoyuba6+CmFtAMH+/ftra2s7COjVuim0
+iEcf/axfsI8x5twRGGjYufPhrVsXJyeHUsrEdlf7oZTLMiUE33//yFOnVj7yyBRK2wgBAKQoVJL8
+Dh78YenSHerqV13cOl2HhUr1DmGMdDpSX3/p22/3C1+3FnU3RAC1obNnz+7atau9vd1L007WzwnB
+r756YOPGI/0y9xmTo6IsBw8+vnBhiixT4dIRWNN+CEE6HRF7LoOBbNiw4JVX5lNqwxg5aeC/deux
+F1/cRwimVJV/AM79ppAK6opvb2/ftWtXSUlJl9iHbsUFiXds2rQpOTl52rRpnoydzoAfJkk4M/Ps
+Y4/twNjotIH0ndQFYP7+ur17l40ZEyHLVJKwpy26+q/Q7hWFzZw5uKVFyck5R4gwjQDGhgMHzqam
+Ro8YMVBs472YuYKDg69cuVJQUJCWlubi5nQHn1aAuu5OnDhRU1MzZ84c7/cLda2mpuWJJz4DQJx3
+14Ryo4AxAnC8+ead48dHORxUhIx7R4Rzb48IwYyx116bm56eRGm7sMFxDgDSU0/9b0VFsyRhL/YS
+8Yrbb7+9trY2Ly9Pxd4NEUCFc+fOTZgwYeDAgWL6u9+g2kcB4Omnd1dVNRCi57wvN7rC/mWbNWvo
+8uXjKWU6He5SErrQQAjb116bCyAJAwnnjBBdXV3jr36122WY7sAYCwsLGz9+vOBCXbzURy3Iydap
+oijafIfr7+kw4UoS3rLl1H/912ZCTJT2tZkBIcS5PTNz6fz5yaIzvicMqWillEsSzsjYsnNnASEm
+oRQRgilt+/DD+x9+eKyzZe6GhA7M2O12Qoga7O3pdb6yIPEXY+w1qodzziUJNzXZXnghC0ByKgJ9
+BxgD546UlIjbb08AAEKuCUwfQTu0hx4aDYDUKcoYB9D9/vdfX77c5oURiZWk1+tFYD14FcVdEECr
+fbq8wH36g9Ph8Ne/ZpeV1fU581HRp8ycOVinI6pVuQftCH1/6tTYoCALY1SIUs45IfrKyvo///mQ
+kx6uyHVHTqc49JUA2na1Ar2zUXHOQZJweXnTO+/kAhj7nvmoMG5c9I08rlpABw70T0oKBVCc4xV+
+JNM//nHk3LkGwdw6fVz7txc2YoyxrVu3lpaWImecs4fbOACsXftdc7OVEOlGwgh6DJwDAImNDdTi
+omcghhMTYwFg2glNCGltbX3jjRzoLNhWizSEUHl5+datW51G307AGwFU/amqqur48eOSJHm9EyQJ
+V1Vd/fDDEwCG/jLxc84BkNEoAXRD8HpoCgDAZNJdP5PEIjBs2lRQXt4kFoEXFi9J0vHjxysrK8GD
+PurTCvj+++9jYmJiY2O9CHQxFz766ERjYxMh0s1OO/AEIoDH4VBUDN4g2GyK20zihEhW69UPPsgD
+z4tACIOYmJiYmBgRkd8pdEEAsXssKioaOnQoeBAj4pokYYeDbtpUAKDrD+eiOmwAoCIKE3ywBHgd
+OwKAqqqrAC68XvBh/ebN37e3y5KEPWOGA0BycnJRURFowgOve0uX/bBarYqiCAJ4gI44hm++KS0q
+qkVI31/TX2AHAPLza26kCTU5oKGhraTkCgBxGRHngLHu/PlLWVkl0FmwiRaGDx8uy3JTU1Onv3at
+hgYEBKxevTo2NhY8y3TRvU8/PQ1ARZbnTcaytw4DSPv3lzHGvMxN39qB3NyLDQ3NGEvubYjYrU8/
+PeOpBRVXMTExq1evDgwM7PQ2bwRQce2Siu4OkoStVntW1vn+5T8AwBhHSHfqVPWBAxfAq5biCdSg
+MQDYvPl7pwrE3V8EoP/669LGxnZP+qgAQojJZPLkG/BIAHXiMK/bWTWO6tixqsrKKwjp+rv2hBgk
+FWqi6Ex3nU6UMknCBQW1//73GQADpZ1MKc4BY6murik3txKgI4PBS8ue3ANdywDkBPDo/AIA2Lev
+FEDpNPSlbwExxhEyff756W3bTksSVhSP4RpuA7mWmgAAzz2XJcs2LxGJgtL79p33gjoXBLpDFwRo
+bGwsLi7W1gXopAmMACAn56K7sOonEGUbpJUrPz93rkGnI7JMVX+Wx2ec2JdlJkn4j3888OWXZwgx
+ednQcM4ByHffXVSR4OEeYIz98MMPjY2N3SCAQHphYeG2bdu8+h0BY9TY2H7mzCUA7+o/BwBJwuKD
+8Q1F3HsFYVWWLl+23nXXxoqKZkED1UnrptJ0/KsojFKu15O///3Y73+/F2NTp8zn+gelwsLLly61
+CiO2xw4htHXr1sLCQnBj6dhz0wAADQ0N4eHhXpawuF5aeqW+vsVrKnOHl0pRWsSHMYcz1vWm0IAx
+hrHh7NlLU6a8n51dIXwyAsXOND+uutFlmQonEsbouee+XrlyB8Z6sey9vINzQAg3NbWWlDQAeHMP
+IIQiIyMvXboE18cVgpcMGTHrm5qagoKCwHMqj2iqqOgygEyI5FkjRgA0JMT/oYemMMbNZik7u+Lw
+4dKbKbQ7aFBV1Txjxvqnnpry/PO3RUT4u3gyEOpYxAihb74pW7MmKz+/lBATpeCLFw9jRKlcVHR5
+ypRY7wMJCQnpdCvQBQFqampGjRrllQAcAM6fvwLAvOTxYIwYYxER/m++OU+WqU5H/vzn7MOHfyDE
+IIzGN48GCOk452+/vf/DD/MXLhy+cGHK2LER4eH+BgNhjLe0OMrKmg4evLBly+mjR0sBgBA/Sn2N
+GxNDPn/+CnheAeK62WwWDjIXNHZBgGnTpkVFRUFX4ebl5U2+ONc45yIwRKcjvZh54R1FnDPOESF+
+Vqt948bcjRuP6HTmsDA/k0lijDc12RsbW0SQIcZGABBJHD5uZYTtr7y8CTy4SVS8DR8+XPASn1iQ
+2sqUKVPUnAsPdwIA1Na2+DhfCMGS1FHWrk8IAKJjlFIATIiZc5BlWl3d6JzjCIBIkr8QBt0NHhDR
+QLW1LeDZ9C2iZuPi4uLj413Q65EAmjypTqrruOAUABobbW4Wq1sN1KhCBIAQujZwkSmlva27LTc2
+2gDAwxS9LoPapRwXdOkPgK58GkL/bWlx9GuAfzeQ5RyaWu/gWnC5Om7fmxMsqLXVIaLYfbv/OvDG
+grR830vrjHFZ7gPvu8hX6ZhBIkyhM6q73MY830Mo5ZxTkQ/sXBmYENJVRTJXbMkyY4x7spZ5R6a3
+fUBLS8uWLVvq6+vBqzlFNQfdzG2wCM6hYg9BaZsT+7yz2xTnbe2aeobqDYKjUkVp4dxuNOojI4Ni
+YkIiIgJNJj3nsqK0cE67lRPp3RAkfrpy5cqWLVuam5tdEOUtU16W5ZMnT6alpYWFhXnxhWGMhOHX
+R5NLDwAhxLmSmDhw6dIxisIaG9vffvuou5EAIcS5nJoac999IxWFVVdffe+945p7OIDI226LjBzw
+4INjfvrTxKSk0MBAA8ZI5AqUlFzZu/f8Bx/k1dZewdjkm2OVq3GPngiAEGptbT1x4oQIKtQi0xsB
+JEkym83ecSra0uvJTfUBYIwoVZKSQl54YRoAlJc3/f3vx9yttOK21NTw55+/DQAKCmrfe++YBoMI
+IWDM9sQT6X/961x/f9cAJ4vFEBUVMH16/G9/O3X58s+2by/A2OidBsJwrdcTX5Q6s9ks/Oq+pqmK
+ux0Oh1cCdHS9D5wwKsZFioTnLl2z7WgvY4w4t/2f/zNt3bq7jUZJWEnb2uTy8qZz5xpqaqxCkDoc
+1GIxbNt23223JTDmS342t1gMahKcJ7DZbACg07nW6/C2AvR6vUhE7Wq0KDTUBNC9ALQegLrKnUmK
+ncO11S1h7UXG5Li4ga+8MotzTgi6etX+4ovf7thRePlyG6XcYCCDBwc//fRPHntsvMNB9Xry7LO3
+HTpUKp72/C4AYCEhRuiq8Ep7eztCSK/Xd4MAGOPHHntM1PL0nH8KABAdbfEgFW8VEEabO+5I9Pc3
+tLXJZrPu/vs/3bPnBMZ+jImodKWwsOrxxz9ubZVXr04DgPHjowIC/K1WG0Letzg8OtqiosIdBOqS
+kpIef/xx99CeLvwB4eHhQgx42oWJ9e6s6dLfaO4KxoyJBACzWXfgQNmePWckKciZ44gAMCEGAOMn
+n5wUN1ssBn9/PYA3didsQaIOjXcsmUymiIgI9xsk762L8nVqRpj78+JKSkooAOmrKgM9AcY6nPWt
+rQ4AyM4uBxD7gA59X5hFAXBbm+K7QUIUAkpJGQDXMwltipxKg04R6G0jxjVlNzyB2AkPHTqAEEM/
+BoN2CZxzAN2nn5749NPjAICQjhADAEeoo2QQ54xzBaAlPn6okyRdj4UxBmBwEuAa6kGjC6hGuk43
+Yt6iDcUKsFqtfn5+nuISRVNxcUFxcUGlpZcRkm5VixAC4BgbCUGEYIdDobTdyV4wgC4gwBgVFTB9
++k9efHG6ry0i4JzGxAQPHhwMzrmoTSRV+YdLQrX2YhcEqK+vX7du3YoVK8LDwz3xOEqZwSCNHRtR
+WlqLsa6v7Mw9Ac5BURRZtpnNAWPHJo0eHT506IDBg4NiYizh4f4DBpj1euKJV7iD2HaMGRMhSj6p
+GawIIVGhua2tbefOnQ888IBIquCaepLqsujCHxAYGMg5r62tDQ8PBw9iQEz5GTPit28/0d8Y9oZ8
+hDDnsr+/Yc2a2cuXj42OtrjkPAuk1NW1DhhgliRfeCkC4NOnx6tI4M6ikQcPHszOzo6MjLRarcXF
+xXFxcRaLRSS3MsbKysqioqLE8RHehDDn3Gg0hoWFlZeXjx492jOlOABMnz4Yof7MCegCVQhxLkdF
+WfbsWTpq1EBhvUEItbfLVVXWysqrZWWNZ8827N9fTik7cuQx8MG0RSkD0M+cORg6WLHgchgApkyZ
+Eh8fn5WVxRj7/PPPbTabxWKJiopKTEwMDAz8+OOPn3zySXEgiDcCCGIOGjSouLgYPAgl9YyUUaPC
+x42LyMu7eMP17W4UtPsvFUSm0IYN944aNdBmU4xG6fDhin/841hOzsXKyquybAdQMAbG6MiR8T7y
+H8Yco0ZFjh0bKf510gA45xaLJSgoqLq6OiIiYuTIkefPn7948eKFCxf279/f0NCQkpISGRkJLn6J
+zpArVMyU9vZ2tR5Kp3dSyiUJ3XNPSl5eGUJGgJu7DrwkmwLwyEg/l6uEIErtkycPmTcvyeGgRqP0
+t79995vf7EKIca5T62ASgh0Ouyj02hWIIgjyXXcNxRiJkihOSndwaUrpnDlzBMYSEhKGDBkixHJj
+Y6PZbAY199UL9gVPTEpKSk5O9u6cEZczMob/z/8cuHkZ8S6ntbj/DsABsJiSLmMBoGlpMQCg15Pq
+auvLL2cBSJKkUxQm3DLCNwDABUftCkSahnHx4hHunXGWLcCHDh3Ky8tDCA0aNGjq1KkiwCc0NFSV
+85zzLjxiWsekp4Q/5KzNOXJk+OzZgwEcvgQoIoQAsBqn5eXj3CJdA6NRMplc3B8dWbQDBwbOnDmk
+09GEh/uLb+XlV6xWGWNJRGupN0gSAXAMGxaqGbtHCzyAfcaM+HHjotQCNi5427VrV2ZmZnJycmJi
+Yk5OjsPhOHnypOpcUbUgn6xa2mM/PBn9Bd9/9NEJaje8E4BzGaBFUVrVUC1PH84V56JmAKAoLDzc
+f9y4CACbXt9R+EGSCCEYoPU3v7ltwACzqCbtAlZrh1k3IiJAr8ecc0lSH0eSRByOlvDw0Fdeud05
+duHkwm7hNuI7f/TR8eAWgC12r3V1dceOHVuxYsX8+fMTEhLi4uIGDRqUm5u7bds2uD5+ouvSxej6
+2kyeQDDBBQuGjRoVfepUDcZ6T6JYrI/x4wc98sjtAQEGr1l/YDJJu3efLS6uA5AqKpplmYrH//Sn
+eXPm1FitzSK0i3PKOaxcOXvNmnS1sI8WKQD4++9rAcDhoEOGhDz2WNq77+5jTM8YEtoj5zBpUuLG
+jfeKoiqEYEIwxgqAnXOjtmAlQpgxx9ChkYsWjQC38A6BpbKystDQUBEGcezYsYSEBAC4995733nn
+ncrKypiYGLXUQBcEUGNSDh482NzcfPfdd3dapAA5yyHqdHjVqsmPProNIYO7KBaF6MUsnjVryJw5
+CV62PMLxK0m4vr61uPiiJPn98EPd4cMVM2YMttuVSZOi8/OfWrs2Ny+vRlFYQkLwL34xZt68RADY
+uLHgrruSQ0PN6pZQxPLv23e+pKQhMTFUlunatT/9yU+it207U1fXoteThISQBQtS7rwzyWCQGhvb
+jUbJaEQGg/SrX6W/8UZua6ujudnmHAvHGFOqPP30ZOFUEDWxtKgAAD8/v6tXrzocDs55ZWXlrFmz
+AMBisRiNRhf/iq95wnq9/rvvvrNarWpghadF8NBDY1JTB1HaiStD6KyEYEKQpyqCngBjBMDWrNnb
+0uIwGCRZpoMHB61dOz87+5EjRx7bvHnRHXckAMBf/5rzyiv7goONoIlY5hwwJm1tbatXfymyORnj
+Dz00eteuJUeOPJ6dvfzDDxcuXJhiMEj5+TXp6RvKyhoRQna7smpVWlXVMw8/PAbARggSyg+l9pSU
+qGXLxrlMf62eMmzYMKPRuHXr1ry8vIEDB0ZHRwPA6dOnKaXiu08uSe1948aNy8rKOnny5G233ebJ
+LCoWgV5P/vCHmYsXb3KZzgCorU0+dOiC78YixlhgoLG2tgUAKwrD2HD8+IVZsz745z8XpqaGq3HO
+oj/Nze0vv3zgzTe/iY+PPHSowmzWnTp1SdsUxsbMzNNz5360bt09Q4YEO+cQF1HTly+3vv320ddf
+P9Ta2rxhw4m//W2uWoxAOFydwQ3AOX3xxZkmk+v0V3l1W1ub2Wx+5JFHNm7cKPhPTk5OTU1Nbm5u
+RkaGwWDQchGf4gkFF9q9e/fJkyefe+457dmCbljukEJ33bUxM/MMIWZnpJ/qrunBeQgEAKsBDYzZ
+JUmaPj1xxoy4uLggnY5cvtyan1+7e/cP9fUNGJsZY863IAA1XxyphVSMRuOcOUnp6bExMRaEUG2t
+9ejR6qysksbGKxibADBjjgULRt5zT4rJJFVVWf/1r/yiolqEJIQQY+1z5qR89dVS7cFsKkIF9r/4
+4osFCxbodDpZlk+dOnXq1Kn6+nqz2Zyeni7OI9VObp8IIO6ur6/funXrkiVLhCbrKVZXBBsXFdVP
+nPiP1lbFibsOGvTAaaNWkxT/OQ9BsQOoQZxC2OjV8Gz1LW7hPeJxUT6ROTmw+rhOhOUihDi3qSH1
+AHonq+BGI8rNXTF6dIRaDVQb+EYIaWxsfOutt1asWBEREUEpdT8IE67Hgk8pSuJLaGjok08+6QX7
+HS1ipChs2LCwV16ZA2BzMQyIXU+3Pi7dYYxxDoQYJcmfEDMhJvEFIaI66zXPos4eR86nTNc/TtXH
+CTGpjSMkidgTgPY//GHW6NERatF3AfX19QL7lNLg4OCwsDCRGAwaxb2trU1dKNpJ373kKRfC+MaI
+ThPi52RE/6HACSGUtt1+e0pW1jXmI5Bgs9lef/31gICABQsWDBo0CCH0zTffHDlyJCUlpbGx0Waz
+ORyOpqamMWPGLFy40L3OW/fKVoLGeOuJBiLaUj2BdPLkdRUVTRjr+7tAdM+xL0rQR0YG5OauiI0N
+FEPT8pPa2tq9e/eeOXNm6NChCxcuBIC33norPDw8MDDQZDL5+fkZDIbU1NROmUf3YtmcWZy0tbU1
+ICDAMw2u1e07ePDCnDkbZFn1Cv1n0aDj9BiEWFbWstmzh7gXylLnYmVl5e7du0tLS8ePH19RUbFg
+wYLk5GRtbdtO0dW9mnGilYKCgrffflsEunRKvw5nm4QVhU2bFrdhwyIAu6hZeMvGrXQ6XBHKyLn9
+/ffvnT17iKi+6C5UBURHR69YsWLFihX19fXV1dUHDhxoaWkRKoOQLp1O1m4fZ4sQCgkJOXz4cFNT
+0/Dhw9UW3TNDOOeEYEWhY8dG+vub9+49TYj+epXmVgYOgCQJUdr6xz/euWpVmkjs6TQHpr29/bPP
+PtuxY0dRUdGkSZOmTZsWExNTVFSUlZVlt9tjY2NFPFanWUbdI4DQeXU6XVhY2K5duxISEgRf8xCa
+isQ5RpTy9PRYQvTffHNGkv4jaNCBfUVpfeGFef/93zO0ey4XwwNj7P33329sbExPT9fr9YmJiQI/
+aWlpFoslPz9/xIgRJpMJPOjg3ZYB4NRwPv7448rKymeffRa8pvAh5ylVkoT/9Kfs5577nBAjY7jv
+y8n5PkqEMMac0vaXX57/hz9M91SCXjipjh07lpWVtWbNGrWcoSzLe/bsSU9PDw4OppS6HMbuAt07
+yE3b0J133nnlirfsQO39hICi0N/9Lj0kxLRixQ7OMSG6W1I35RgTzmVK6TvvLF65cqIn7KuGkKqq
+qoiICL1eL8syxlhUNTlx4oSiKPfee2+X7+v5ESYWi2Xw4MEuEqlTd42TBliW6eOPj//yy0eCg42U
+tkuScKrcImJZJPITxtoDAgyff7505cqJskxdsK8OkznPlIuKiqqoqGhtbRWRz4qi6HS66dOni6TU
+Ls9w7DYBtL1Rjy1xiezw9IgkYVmmc+cmHD/+1MSJgxWlhRDo6flcvYx9jDEhoCgtY8bEHj/+5F13
+JQudx9MACSFiso8dO9ZsNn/44YeiUqu48/Lly2qCu/cXd1sLguvLMoovly5dUhTFZDJ5OstE02+s
+KCwkxLRs2Vi7nWRnn+dcIUTv9Oj2PUfqyBdjzME5Xb165iefLB440F/oPNrxav2INpvt8OHDR48e
+tVqt0dHRI0eOzM7OPnjwoF6vlyQpNzf38OHD9913X1BQkJcM347GbySpSDWUbtiwwWq1Pv300ypt
+vItlcWCLOI9lxYrdp0+XI2TEWHKu674hA3dGSimc21JSYtetu+v6s9w6hgiaEAWEUGNj4/r16yml
+AwcOLCsrE5bnkJCQL7/8sqCgQJZlPz+/u+++e8SIEVor6U0hgIrQq1evvvHGG3FxcUuXLgXPSpH2
+EVU1stuVd9459uqr+5uaGvuKDNeh3mIJfP756atWpQkPl/ASg5PBqtNfDeh8//33CSHLly8HgLa2
+to8//ri0tHTVqlXh4eF2u729vT0gIEA1gnYZ5dgTFnQdARFijBmNxmHDhu3Zs+fixYujR4/2/mIt
+OxJG3alTY5ctGwugP3WqzmazAiCMJe8FYHqGdwDkFKoK5+1+fuaVK9O3bFk8b16SKJWrMn2xshlj
+Fy9erK2t9fPz0+v1CKGmpqY9e/YsWrQoKCiIUmowGMaNG1dcXHzmzJlJkyYRQoxGI3Kecuc9lkfA
+jZ4nrHY0PDx8+fLl3377rcPhMBgM4HUdqNNKnISgKCwszO8vf7n9179Oe++9vPXr86qr6wEAQC8E
+XbdOse3sdcI9KU4HdQBARMSARx8dt2LFhOhoC2PcRdcUgyopKdm5c6fVahWCbfHixampqeJXNW1L
+WPx/+tOfrl+/vq6uLjw8XCj+XmoL9DIBtNSOj49ftmyZOgzBSbyXOVBrjgosRET4v/TSjDVrpmRm
+nvvoo5P795e1tVkBAEAHIKk4UvPcPaFbcA6V0XGuUKoAcJMpYNq05IcfHn333UNFlqTgOcLCIxoU
+6M7Pz//kk09mzJiRnp5OCMnMzBTFZgIDA+Pi4r766qvhw4cTQhRFAYCgoCBCiN1uB429wUffU68d
+6KyuXK28cr/i4XEQfFk9XlkMoLraundvyZ49JTk5FysrmwDEKWDCQyk+1zXpNHIw50ds9PRRUUFT
+pgyaNy9x7tzEmJiOoGj1CGn3GOnGxsa//OUv99xzT1pamjYmU8yn+vr6N998MyEh4cEHH9TpdAih
+L7/88uTJk7/97W99n/i9TACVDNfaRSgvLy8iIiI6OrrL7bg7ISnlCF07q6u9Xf7hh4a8vOrvv68r
+LKyvrLx66VKr1eqQZVlzJh4CwDqd5O+vHzjQLybGMmxYWGpq+PjxUcOGDTCZdFoFzNP5aoKlZGdn
+Hzhw4He/+506lxFCLS0ttbW1JpMpOjq6srLygw8+UBRlxIgRjY2NFy9efOSRR4YMGeLLIeIu0Jtn
+yrsYab///vtt27YtW7YsJSVFXQq+tAAA6lmaooSM0SiNGRMxenQ4dIh93txsa262NzfbbDZFVKrQ
+6bDRKAUGGi0WQ1CQ0WVqi7P7xKmFWut8px0wGAytra1NTU2hoaGKopSXlx85cqS4uNhms1FKp0yZ
+snjx4meeeSY3N/f8+fMhISH33nvvwIEDuQ8ZXZ0MuRdXgArq8L744ouvvvrqjjvumD17ttejNzy1
+I8JAROHBDtYv+IYXh6jTRX7tLFRN8lAXJdWdC679jTfeYIwlJiaWl5c3NDRERUVNmDBhyJAhZWVl
+27dv/8UvfjF27NgunS39QwAt98cYnzlzZvPmzUuWLBk1apSWn/asu2pvPVVkVaN3tP92t32EUHV1
+dWZmZnNzc0JCwsSJE0U0lfhp3bp1gYGBS5YsURRF3eX2gPvfLAK406ClpcVgMOh0Og361KolXWvK
+fQlaa4/LF+HVkiTp7bffjo6OzsjIELLtBvvfwyPNvYM6u4Uyqk2yFIYUdffgyX7Xl6BqONq9K3cm
+1MmyzJ1nF0qSdOjQocrKysmTJ4NTON/g7OlNIawFtVtaHU5c+eijjzDGGRkZAwYM8FE43yTQmnVB
+M+XVBVpXV/fBBx/Mnj07NTX16tWr+/bty8vLe+CBByIjIz2dpNZtRPXZ7FOXc2lp6RdffFFRUTF2
+7NhZs2aJBNjr+tQj8dDdzqjTXFWRtdtGZ2CHsmvXrtzcXJPJpChKWFhYRkZGbGyslwOsuwt9vfxV
+Mpw9e3bHjh1JSUmLFi1y2eyoJtxep4SLyFH/LS8vz8zMHD16dHp6urtuc+nSpbq6uuDg4KioKME5
+u9xa3ooEUMejVmJUFEVRFJEuK8Zjs9lUY1ZH/9yQ1bP3goa0Ku7sdntOTk5+fn59fX1CQsIdd9wR
+FxenfbX7svDdyuYj3CwZ4A7qNk0MQARTqmfNAYDNZlu7dq3FYpkwYUJSUpI4ckKrh2hnnIvBw9O7
+tPeD2ykuIm8rMTHxoYceEjsp7SMuEkIVxb27KPtHA3HX9gTDPXv27MmTJ8+fP2+1WtPS0jIyMnqw
+uXdRIgU0NzdXVlYWFhaOHz8+ISFBZXoqu+uyQupNgr5bAVpwd2oCgCRJw4YNGz58uKIo586dcxED
+R44cqampGTRoUGBgoMViCQ4OFhsLLaIZY4qiUEpFjSN1J7hjxw5ZlgkhgYGBqampLj1RVaA+EP6d
+oKJ/dXABWg4LTkah5d0iSe3YsWMOh8Nms8myvHLlyujoaDGR29vb169f39LSIqwI4eHhK1euBKdh
+ubq6uqioaMiQIZGRkULegJvZqh93grcEAQRop7N2q6xlVoyx1tZWq9U6YMAAbSDU8ePHEULiANOg
+oKDY2FithHCRFv0y0z3BLUQAT6C6d7TaIfiAR5c9bZcBA/0C/wEEEKDtZ6duHy1a3Wtk37LwH0OA
+/1fhphjjfgTf4f8C4VLHz/5KLxoAAAA8dEVYdGNvbW1lbnQAIEltYWdlIGdlbmVyYXRlZCBieSBH
+TlUgR2hvc3RzY3JpcHQgKGRldmljZT1wbm1yYXcpCvqLFvMAAAAASUVORK5CYII=
diff --git a/gem/input.bin b/gem/input.bin
new file mode 100644
index 0000000..d24a954
Binary files /dev/null and b/gem/input.bin differ
diff --git a/gem/ltn012.tex b/gem/ltn012.tex
new file mode 100644
index 0000000..8027ecc
--- /dev/null
+++ b/gem/ltn012.tex
@@ -0,0 +1,695 @@
+\documentclass[10pt]{article}
+\usepackage{fancyvrb}
+\usepackage{url}
+\DefineVerbatimEnvironment{lua}{Verbatim}{fontsize=\small,commandchars=\@\#\%}
+\DefineVerbatimEnvironment{C}{Verbatim}{fontsize=\small,commandchars=\@\#\%}
+\DefineVerbatimEnvironment{mime}{Verbatim}{fontsize=\small,commandchars=\$\#\%}
+\newcommand{\stick}[1]{\vbox{\setlength{\parskip}{0pt}#1}}
+\newcommand{\bl}{\ensuremath{\mathtt{\backslash}}}
+\newcommand{\CR}{\texttt{CR}}
+\newcommand{\LF}{\texttt{LF}}
+\newcommand{\CRLF}{\texttt{CR~LF}}
+\newcommand{\nil}{\texttt{nil}}
+
+\title{Filters, sources, sinks, and pumps\\
+ {\large or Functional programming for the rest of us}}
+\author{Diego Nehab}
+
+\begin{document}
+
+\maketitle
+
+\begin{abstract}
+Certain data processing operations can be implemented in the
+form of filters. A filter is a function that can process
+data received in consecutive invocations, returning partial
+results each time it is called. Examples of operations that
+can be implemented as filters include the end-of-line
+normalization for text, Base64 and Quoted-Printable transfer
+content encodings, the breaking of text into lines, SMTP
+dot-stuffing, and there are many others. Filters become
+even more powerful when we allow them to be chained together
+to create composite filters. In this context, filters can be
+seen as the internal links in a chain of data transformations.
+Sources and sinks are the corresponding end points in these
+chains. A source is a function that produces data, chunk by
+chunk, and a sink is a function that takes data, chunk by
+chunk. Finally, pumps are procedures that actively drive
+data from a source to a sink, and indirectly through all
+intervening filters. In this article, we describe the design of an
+elegant interface for filters, sources, sinks, chains, and
+pumps, and we illustrate each step with concrete examples.
+\end{abstract}
+
+\section{Introduction}
+
+Within the realm of networking applications, we are often
+required to apply transformations to streams of data. Examples
+include the end-of-line normalization for text, Base64 and
+Quoted-Printable transfer content encodings, breaking text
+into lines with a maximum number of columns, SMTP
+dot-stuffing, \texttt{gzip} compression, HTTP chunked
+transfer coding, and the list goes on.
+
+Many complex tasks require a combination of two or more such
+transformations, and therefore a general mechanism for
+promoting reuse is desirable. In the process of designing
+\texttt{LuaSocket~2.0}, we repeatedly faced this problem.
+The solution we reached proved to be very general and
+convenient. It is based on the concepts of filters, sources,
+sinks, and pumps, which we introduce below.
+
+\emph{Filters} are functions that can be repeatedly invoked
+with chunks of input, successively returning processed
+chunks of output. Naturally, the result of
+concatenating all the output chunks must be the same as the
+result of applying the filter to the concatenation of all
+input chunks. In fancier language, filters \emph{commute}
+with the concatenation operator. More importantly, filters
+must handle input data correctly no matter how the stream
+has been split into chunks.
+
+A \emph{chain} is a function that transparently combines the
+effect of one or more filters. The interface of a chain is
+indistinguishable from the interface of its component
+filters. This allows a chained filter to be used wherever
+an atomic filter is accepted. In particular, chains can be
+themselves chained to create arbitrarily complex operations.
+
+Filters can be seen as internal nodes in a network through
+which data will flow, potentially being transformed many
+times along the way. Chains connect these nodes together.
+The initial and final nodes of the network are
+\emph{sources} and \emph{sinks}, respectively. Less
+abstractly, a source is a function that produces new chunks
+of data every time it is invoked. Conversely, sinks are
+functions that give a final destination to the chunks of
+data they receive in sucessive calls. Naturally, sources
+and sinks can also be chained with filters to produce
+filtered sources and sinks.
+
+Finally, filters, chains, sources, and sinks are all passive
+entities: they must be repeatedly invoked in order for
+anything to happen. \emph{Pumps} provide the driving force
+that pushes data through the network, from a source to a
+sink, and indirectly through all intervening filters.
+
+In the following sections, we start with a simplified
+interface, which we later refine. The evolution we present
+is not contrived: it recreates the steps we ourselves
+followed as we consolidated our understanding of these
+concepts within our application domain.
+
+\subsection{A simple example}
+
+The end-of-line normalization of text is a good
+example to motivate our initial filter interface.
+Assume we are given text in an unknown end-of-line
+convention (including possibly mixed conventions) out of the
+commonly found Unix (\LF), Mac OS (\CR), and
+DOS (\CRLF) conventions. We would like to be able to
+use the folowing code to normalize the end-of-line markers:
+\begin{quote}
+\begin{lua}
+@stick#
+local CRLF = "\013\010"
+local input = source.chain(source.file(io.stdin), normalize(CRLF))
+local output = sink.file(io.stdout)
+pump.all(input, output)
+%
+\end{lua}
+\end{quote}
+
+This program should read data from the standard input stream
+and normalize the end-of-line markers to the canonic
+\CRLF\ marker, as defined by the MIME standard.
+Finally, the normalized text should be sent to the standard output
+stream. We use a \emph{file source} that produces data from
+standard input, and chain it with a filter that normalizes
+the data. The pump then repeatedly obtains data from the
+source, and passes it to the \emph{file sink}, which sends
+it to the standard output.
+
+In the code above, the \texttt{normalize} \emph{factory} is a
+function that creates our normalization filter, which
+replaces any end-of-line marker with the canonic marker.
+The initial filter interface is
+trivial: a filter function receives a chunk of input data,
+and returns a chunk of processed data. When there are no
+more input data left, the caller notifies the filter by invoking
+it with a \nil\ chunk. The filter responds by returning
+the final chunk of processed data (which could of course be
+the empty string).
+
+Although the interface is extremely simple, the
+implementation is not so obvious. A normalization filter
+respecting this interface needs to keep some kind of context
+between calls. This is because a chunk boundary may lie between
+the \CR\ and \LF\ characters marking the end of a single line. This
+need for contextual storage motivates the use of
+factories: each time the factory is invoked, it returns a
+filter with its own context so that we can have several
+independent filters being used at the same time. For
+efficiency reasons, we must avoid the obvious solution of
+concatenating all the input into the context before
+producing any output chunks.
+
+To that end, we break the implementation into two parts:
+a low-level filter, and a factory of high-level filters. The
+low-level filter is implemented in C and does not maintain
+any context between function calls. The high-level filter
+factory, implemented in Lua, creates and returns a
+high-level filter that maintains whatever context the low-level
+filter needs, but isolates the user from its internal
+details. That way, we take advantage of C's efficiency to
+perform the hard work, and take advantage of Lua's
+simplicity for the bookkeeping.
+
+\subsection{The Lua part of the filter}
+
+Below is the complete implementation of the factory of high-level
+end-of-line normalization filters:
+\begin{quote}
+\begin{lua}
+@stick#
+function filter.cycle(lowlevel, context, extra)
+ return function(chunk)
+ local ret
+ ret, context = lowlevel(context, chunk, extra)
+ return ret
+ end
+end
+%
+
+@stick#
+function normalize(marker)
+ return filter.cycle(eol, 0, marker)
+end
+%
+\end{lua}
+\end{quote}
+
+The \texttt{normalize} factory simply calls a more generic
+factory, the \texttt{cycle}~factory, passing the low-level
+filter~\texttt{eol}. The \texttt{cycle}~factory receives a
+low-level filter, an initial context, and an extra
+parameter, and returns a new high-level filter. Each time
+the high-level filer is passed a new chunk, it invokes the
+low-level filter with the previous context, the new chunk,
+and the extra argument. It is the low-level filter that
+does all the work, producing the chunk of processed data and
+a new context. The high-level filter then replaces its
+internal context, and returns the processed chunk of data to
+the user. Notice that we take advantage of Lua's lexical
+scoping to store the context in a closure between function
+calls.
+
+\subsection{The C part of the filter}
+
+As for the low-level filter, we must first accept
+that there is no perfect solution to the end-of-line marker
+normalization problem. The difficulty comes from an
+inherent ambiguity in the definition of empty lines within
+mixed input. However, the following solution works well for
+any consistent input, as well as for non-empty lines in
+mixed input. It also does a reasonable job with empty lines
+and serves as a good example of how to implement a low-level
+filter.
+
+The idea is to consider both \CR\ and~\LF\ as end-of-line
+\emph{candidates}. We issue a single break if any candidate
+is seen alone, or if it is followed by a different
+candidate. In other words, \CR~\CR~and \LF~\LF\ each issue
+two end-of-line markers, whereas \CR~\LF~and \LF~\CR\ issue
+only one marker each. It is easy to see that this method
+correctly handles the most common end-of-line conventions.
+
+With this in mind, we divide the low-level filter into two
+simple functions. The inner function~\texttt{pushchar} performs the
+normalization itself. It takes each input character in turn,
+deciding what to output and how to modify the context. The
+context tells if the last processed character was an
+end-of-line candidate, and if so, which candidate it was.
+For efficiency, we use Lua's auxiliary library's buffer
+interface:
+\begin{quote}
+\begin{C}
+@stick#
+@#define candidate(c) (c == CR || c == LF)
+static int pushchar(int c, int last, const char *marker,
+ luaL_Buffer *buffer) {
+ if (candidate(c)) {
+ if (candidate(last)) {
+ if (c == last)
+ luaL_addstring(buffer, marker);
+ return 0;
+ } else {
+ luaL_addstring(buffer, marker);
+ return c;
+ }
+ } else {
+ luaL_pushchar(buffer, c);
+ return 0;
+ }
+}
+%
+\end{C}
+\end{quote}
+
+The outer function~\texttt{eol} simply interfaces with Lua.
+It receives the context and input chunk (as well as an
+optional custom end-of-line marker), and returns the
+transformed output chunk and the new context.
+Notice that if the input chunk is \nil, the operation
+is considered to be finished. In that case, the loop will
+not execute a single time and the context is reset to the
+initial state. This allows the filter to be reused many
+times:
+\begin{quote}
+\begin{C}
+@stick#
+static int eol(lua_State *L) {
+ int context = luaL_checkint(L, 1);
+ size_t isize = 0;
+ const char *input = luaL_optlstring(L, 2, NULL, &isize);
+ const char *last = input + isize;
+ const char *marker = luaL_optstring(L, 3, CRLF);
+ luaL_Buffer buffer;
+ luaL_buffinit(L, &buffer);
+ if (!input) {
+ lua_pushnil(L);
+ lua_pushnumber(L, 0);
+ return 2;
+ }
+ while (input < last)
+ context = pushchar(*input++, context, marker, &buffer);
+ luaL_pushresult(&buffer);
+ lua_pushnumber(L, context);
+ return 2;
+}
+%
+\end{C}
+\end{quote}
+
+When designing filters, the challenging part is usually
+deciding what to store in the context. For line breaking, for
+instance, it could be the number of bytes that still fit in the
+current line. For Base64 encoding, it could be a string
+with the bytes that remain after the division of the input
+into 3-byte atoms. The MIME module in the \texttt{LuaSocket}
+distribution has many other examples.
+
+\section{Filter chains}
+
+Chains greatly increase the power of filters. For example,
+according to the standard for Quoted-Printable encoding,
+text should be normalized to a canonic end-of-line marker
+prior to encoding. After encoding, the resulting text must
+be broken into lines of no more than 76 characters, with the
+use of soft line breaks (a line terminated by the \texttt{=}
+sign). To help specifying complex transformations like
+this, we define a chain factory that creates a composite
+filter from one or more filters. A chained filter passes
+data through all its components, and can be used wherever a
+primitive filter is accepted.
+
+The chaining factory is very simple. The auxiliary
+function~\texttt{chainpair} chains two filters together,
+taking special care if the chunk is the last. This is
+because the final \nil\ chunk notification has to be
+pushed through both filters in turn:
+\begin{quote}
+\begin{lua}
+@stick#
+local function chainpair(f1, f2)
+ return function(chunk)
+ local ret = f2(f1(chunk))
+ if chunk then return ret
+ else return ret .. f2() end
+ end
+end
+%
+
+@stick#
+function filter.chain(...)
+ local f = select(1, ...)
+ for i = 2, select('@#', ...) do
+ f = chainpair(f, select(i, ...))
+ end
+ return f
+end
+%
+\end{lua}
+\end{quote}
+
+Thanks to the chain factory, we can
+define the Quoted-Printable conversion as such:
+\begin{quote}
+\begin{lua}
+@stick#
+local qp = filter.chain(normalize(CRLF), encode("quoted-printable"),
+ wrap("quoted-printable"))
+local input = source.chain(source.file(io.stdin), qp)
+local output = sink.file(io.stdout)
+pump.all(input, output)
+%
+\end{lua}
+\end{quote}
+
+\section{Sources, sinks, and pumps}
+
+The filters we introduced so far act as the internal nodes
+in a network of transformations. Information flows from node
+to node (or rather from one filter to the next) and is
+transformed along the way. Chaining filters together is our
+way to connect nodes in this network. As the starting point
+for the network, we need a source node that produces the
+data. In the end of the network, we need a sink node that
+gives a final destination to the data.
+
+\subsection{Sources}
+
+A source returns the next chunk of data each time it is
+invoked. When there is no more data, it simply returns~\nil.
+In the event of an error, the source can inform the
+caller by returning \nil\ followed by the error message.
+
+Below are two simple source factories. The \texttt{empty} source
+returns no data, possibly returning an associated error
+message. The \texttt{file} source yields the contents of a file
+in a chunk by chunk fashion:
+\begin{quote}
+\begin{lua}
+@stick#
+function source.empty(err)
+ return function()
+ return nil, err
+ end
+end
+%
+
+@stick#
+function source.file(handle, io_err)
+ if handle then
+ return function()
+ local chunk = handle:read(2048)
+ if not chunk then handle:close() end
+ return chunk
+ end
+ else return source.empty(io_err or "unable to open file") end
+end
+%
+\end{lua}
+\end{quote}
+
+\subsection{Filtered sources}
+
+A filtered source passes its data through the
+associated filter before returning it to the caller.
+Filtered sources are useful when working with
+functions that get their input data from a source (such as
+the pumps in our examples). By chaining a source with one or
+more filters, such functions can be transparently provided
+with filtered data, with no need to change their interfaces.
+Here is a factory that does the job:
+\begin{quote}
+\begin{lua}
+@stick#
+function source.chain(src, f)
+ return function()
+ if not src then
+ return nil
+ end
+ local chunk, err = src()
+ if not chunk then
+ src = nil
+ return f(nil)
+ else
+ return f(chunk)
+ end
+ end
+end
+%
+\end{lua}
+\end{quote}
+
+\subsection{Sinks}
+
+Just as we defined an interface for a source of data, we can
+also define an interface for a data destination. We call
+any function respecting this interface a sink. In our first
+example, we used a file sink connected to the standard
+output.
+
+Sinks receive consecutive chunks of data, until the end of
+data is signaled by a \nil\ input chunk. A sink can be
+notified of an error with an optional extra argument that
+contains the error message, following a \nil\ chunk.
+If a sink detects an error itself, and
+wishes not to be called again, it can return \nil,
+followed by an error message. A return value that
+is not \nil\ means the sink will accept more data.
+
+Below are two useful sink factories.
+The table factory creates a sink that stores
+individual chunks into an array. The data can later be
+efficiently concatenated into a single string with Lua's
+\texttt{table.concat} library function. The \texttt{null} sink
+simply discards the chunks it receives:
+\begin{quote}
+\begin{lua}
+@stick#
+function sink.table(t)
+ t = t or {}
+ local f = function(chunk, err)
+ if chunk then table.insert(t, chunk) end
+ return 1
+ end
+ return f, t
+end
+%
+
+@stick#
+local function null()
+ return 1
+end
+
+function sink.null()
+ return null
+end
+%
+\end{lua}
+\end{quote}
+
+Naturally, filtered sinks are just as useful as filtered
+sources. A filtered sink passes each chunk it receives
+through the associated filter before handing it down to the
+original sink. In the following example, we use a source
+that reads from the standard input. The input chunks are
+sent to a table sink, which has been coupled with a
+normalization filter. The filtered chunks are then
+concatenated from the output array, and finally sent to
+standard out:
+\begin{quote}
+\begin{lua}
+@stick#
+local input = source.file(io.stdin)
+local output, t = sink.table()
+output = sink.chain(normalize(CRLF), output)
+pump.all(input, output)
+io.write(table.concat(t))
+%
+\end{lua}
+\end{quote}
+
+\subsection{Pumps}
+
+Although not on purpose, our interface for sources is
+compatible with Lua iterators. That is, a source can be
+neatly used in conjunction with \texttt{for} loops. Using
+our file source as an iterator, we can write the following
+code:
+\begin{quote}
+\begin{lua}
+@stick#
+for chunk in source.file(io.stdin) do
+ io.write(chunk)
+end
+%
+\end{lua}
+\end{quote}
+
+Loops like this will always be present because everything
+we designed so far is passive. Sources, sinks, filters: none
+of them can do anything on their own. The operation of
+pumping all data a source can provide into a sink is so
+common that it deserves its own function:
+\begin{quote}
+\begin{lua}
+@stick#
+function pump.step(src, snk)
+ local chunk, src_err = src()
+ local ret, snk_err = snk(chunk, src_err)
+ if chunk and ret then return 1
+ else return nil, src_err or snk_err end
+end
+%
+
+@stick#
+function pump.all(src, snk, step)
+ step = step or pump.step
+ while true do
+ local ret, err = step(src, snk)
+ if not ret then
+ if err then return nil, err
+ else return 1 end
+ end
+ end
+end
+%
+\end{lua}
+\end{quote}
+
+The \texttt{pump.step} function moves one chunk of data from
+the source to the sink. The \texttt{pump.all} function takes
+an optional \texttt{step} function and uses it to pump all the
+data from the source to the sink.
+Here is an example that uses the Base64 and the
+line wrapping filters from the \texttt{LuaSocket}
+distribution. The program reads a binary file from
+disk and stores it in another file, after encoding it to the
+Base64 transfer content encoding:
+\begin{quote}
+\begin{lua}
+@stick#
+local input = source.chain(
+ source.file(io.open("input.bin", "rb")),
+ encode("base64"))
+local output = sink.chain(
+ wrap(76),
+ sink.file(io.open("output.b64", "w")))
+pump.all(input, output)
+%
+\end{lua}
+\end{quote}
+
+The way we split the filters here is not intuitive, on
+purpose. Alternatively, we could have chained the Base64
+encode filter and the line-wrap filter together, and then
+chain the resulting filter with either the file source or
+the file sink. It doesn't really matter.
+
+\section{Exploding filters}
+
+Our current filter interface has one serious shortcoming.
+Consider for example a \texttt{gzip} decompression filter.
+During decompression, a small input chunk can be exploded
+into a huge amount of data. To address this problem, we
+decided to change the filter interface and allow exploding
+filters to return large quantities of output data in a chunk
+by chunk manner.
+
+More specifically, after passing each chunk of input to
+a filter, and collecting the first chunk of output, the
+user must now loop to receive other chunks from the filter until no
+filtered data is left. Within these secondary calls, the
+caller passes an empty string to the filter. The filter
+responds with an empty string when it is ready for the next
+input chunk. In the end, after the user passes a
+\nil\ chunk notifying the filter that there is no
+more input data, the filter might still have to produce too
+much output data to return in a single chunk. The user has
+to loop again, now passing \nil\ to the filter each time,
+until the filter itself returns \nil\ to notify the
+user it is finally done.
+
+Fortunately, it is very easy to modify a filter to respect
+the new interface. In fact, the end-of-line translation
+filter we presented earlier already conforms to it. The
+complexity is encapsulated within the chaining functions,
+which must now include a loop. Since these functions only
+have to be written once, the user is rarely affected.
+Interestingly, the modifications do not have a measurable
+negative impact in the performance of filters that do
+not need the added flexibility. On the other hand, for a
+small price in complexity, the changes make exploding
+filters practical.
+
+\section{A complex example}
+
+The LTN12 module in the \texttt{LuaSocket} distribution
+implements all the ideas we have described. The MIME
+and SMTP modules are tightly integrated with LTN12,
+and can be used to showcase the expressive power of filters,
+sources, sinks, and pumps. Below is an example
+of how a user would proceed to define and send a
+multipart message, with attachments, using \texttt{LuaSocket}:
+\begin{quote}
+\begin{mime}
+local smtp = require"socket.smtp"
+local mime = require"mime"
+local ltn12 = require"ltn12"
+
+local message = smtp.message{
+ headers = {
+ from = "Sicrano ",
+ to = "Fulano ",
+ subject = "A message with an attachment"},
+ body = {
+ preamble = "Hope you can see the attachment" .. CRLF,
+ [1] = {
+ body = "Here is our logo" .. CRLF},
+ [2] = {
+ headers = {
+ ["content-type"] = 'image/png; name="luasocket.png"',
+ ["content-disposition"] =
+ 'attachment; filename="luasocket.png"',
+ ["content-description"] = 'LuaSocket logo',
+ ["content-transfer-encoding"] = "BASE64"},
+ body = ltn12.source.chain(
+ ltn12.source.file(io.open("luasocket.png", "rb")),
+ ltn12.filter.chain(
+ mime.encode("base64"),
+ mime.wrap()))}}}
+
+assert(smtp.send{
+ rcpt = "",
+ from = "",
+ source = message})
+\end{mime}
+\end{quote}
+
+The \texttt{smtp.message} function receives a table
+describing the message, and returns a source. The
+\texttt{smtp.send} function takes this source, chains it with the
+SMTP dot-stuffing filter, connects a socket sink
+with the server, and simply pumps the data. The message is never
+assembled in memory. Everything is produced on demand,
+transformed in small pieces, and sent to the server in chunks,
+including the file attachment which is loaded from disk and
+encoded on the fly. It just works.
+
+\section{Conclusions}
+
+In this article, we introduced the concepts of filters,
+sources, sinks, and pumps to the Lua language. These are
+useful tools for stream processing in general. Sources provide
+a simple abstraction for data acquisition. Sinks provide an
+abstraction for final data destinations. Filters define an
+interface for data transformations. The chaining of
+filters, sources and sinks provides an elegant way to create
+arbitrarily complex data transformations from simpler
+components. Pumps simply push the data through.
+
+\section{Acknowledgements}
+
+The concepts described in this text are the result of long
+discussions with David Burgess. A version of this text has
+been released on-line as the Lua Technical Note 012, hence
+the name of the corresponding LuaSocket module, LTN12. Wim
+Couwenberg contributed to the implementation of the module,
+and Adrian Sietsma was the first to notice the
+correspondence between sources and Lua iterators.
+
+
+\end{document}
diff --git a/gem/luasocket.png b/gem/luasocket.png
new file mode 100644
index 0000000..d24a954
Binary files /dev/null and b/gem/luasocket.png differ
diff --git a/gem/makefile b/gem/makefile
new file mode 100644
index 0000000..a4287c2
--- /dev/null
+++ b/gem/makefile
@@ -0,0 +1,14 @@
+ltn012.pdf: ltn012.ps
+ ./myps2pdf ltn012.ps
+
+ltn012.ps: ltn012.dvi
+ dvips -G0 -t letter -o ltn012.ps ltn012.dvi
+
+ltn012.dvi: ltn012.tex
+ latex ltn012
+
+clean:
+ rm -f *~ *.log *.aux *.bbl *.blg ltn012.pdf ltn012.ps ltn012.dvi ltn012.lof ltn012.toc ltn012.lot
+
+pdf: ltn012.pdf
+ open ltn012.pdf
diff --git a/gem/myps2pdf b/gem/myps2pdf
new file mode 100755
index 0000000..78c23e5
--- /dev/null
+++ b/gem/myps2pdf
@@ -0,0 +1,113 @@
+#!/bin/sh -
+do_opt=1
+best=0
+rot=0
+a4=0
+eps=0
+usage="Usage: $0 [-no_opt] [-best] [-rot] [-a4] [-eps] in.ps [out.pdf]"
+
+case "x$1" in
+"x-no_opt") do_opt=0 ; shift ;;
+esac
+
+case "x$1" in
+"x-best") best=1 ; shift ;;
+esac
+
+case "x$1" in
+"x-rot") rot=1 ; shift ;;
+esac
+
+case "x$1" in
+"x-a4") a4=1 ; shift ;;
+esac
+
+case "x$1" in
+"x-eps") eps=1 ; shift ;;
+esac
+
+case $# in
+2) ifilename=$1 ; ofilename=$2 ;;
+1) ifilename=$1
+ if `echo $1 | grep -i '\.e*ps$' > /dev/null`
+ then
+ ofilename=`echo $1 | sed 's/\..*$/.pdf/'`
+ else
+ echo "$usage" 1>&2
+ exit 1
+ fi ;;
+*) echo "$usage" 1>&2 ; exit 1 ;;
+esac
+
+if [ $best == 1 ]
+then
+ options="-dPDFSETTINGS=/prepress \
+ -r1200 \
+ -dMonoImageResolution=1200 \
+ -dGrayImageResolution=1200 \
+ -dColorImageResolution=1200 \
+ -dDownsampleMonoImages=false \
+ -dDownsampleGrayImages=false \
+ -dDownsampleColorImages=false \
+ -dAutoFilterMonoImages=false \
+ -dAutoFilterGrayImages=false \
+ -dAutoFilterColorImages=false \
+ -dMonoImageFilter=/FlateEncode \
+ -dGrayImageFilter=/FlateEncode \
+ -dColorImageFilter=/FlateEncode"
+else
+ options="-dPDFSETTINGS=/prepress \
+ -r600 \
+ -dDownsampleMonoImages=true \
+ -dDownsampleGrayImages=true \
+ -dDownsampleColorImages=true \
+ -dMonoImageDownsampleThreshold=2.0 \
+ -dGrayImageDownsampleThreshold=1.5 \
+ -dColorImageDownsampleThreshold=1.5 \
+ -dMonoImageResolution=600 \
+ -dGrayImageResolution=600 \
+ -dColorImageResolution=600 \
+ -dAutoFilterMonoImages=false \
+ -dMonoImageFilter=/FlateEncode \
+ -dAutoFilterGrayImages=true \
+ -dAutoFilterColorImages=true"
+fi
+
+if [ $rot == 1 ]
+then
+ options="$options -dAutoRotatePages=/PageByPage"
+fi
+
+if [ $eps == 1 ]
+then
+ options="$options -dEPSCrop"
+fi
+
+set -x
+
+if [ $a4 == 1 ]
+then
+ # Resize from A4 to letter size
+ psresize -Pa4 -pletter "$ifilename" myps2pdf.temp.ps
+ ifilename=myps2pdf.temp.ps
+fi
+
+gs -q -dSAFER -dNOPAUSE -dBATCH \
+ -sDEVICE=pdfwrite -sPAPERSIZE=letter -sOutputFile=myps2pdf.temp.pdf \
+ -dCompatibilityLevel=1.3 \
+ $options \
+ -dMaxSubsetPct=100 \
+ -dSubsetFonts=true \
+ -dEmbedAllFonts=true \
+ -dColorConversionStrategy=/LeaveColorUnchanged \
+ -dDoThumbnails=true \
+ -dPreserveEPSInfo=true \
+ -c .setpdfwrite -f "$ifilename"
+
+if [ $do_opt == 1 ]
+then
+ pdfopt myps2pdf.temp.pdf $ofilename
+else
+ mv myps2pdf.temp.pdf $ofilename
+fi
+rm -f myps2pdf.temp.pdf myps2pdf.temp.ps
diff --git a/gem/t1.lua b/gem/t1.lua
new file mode 100644
index 0000000..0c054c9
--- /dev/null
+++ b/gem/t1.lua
@@ -0,0 +1,25 @@
+source = {}
+sink = {}
+pump = {}
+filter = {}
+
+-- source.chain
+dofile("ex6.lua")
+
+-- source.file
+dofile("ex5.lua")
+
+-- normalize
+require"gem"
+eol = gem.eol
+dofile("ex2.lua")
+
+-- sink.file
+require"ltn12"
+sink.file = ltn12.sink.file
+
+-- pump.all
+dofile("ex10.lua")
+
+-- run test
+dofile("ex1.lua")
diff --git a/gem/t1lf.txt b/gem/t1lf.txt
new file mode 100644
index 0000000..8cddd1b
--- /dev/null
+++ b/gem/t1lf.txt
@@ -0,0 +1,5 @@
+this is a test file
+it should have been saved as lf eol
+but t1.lua will convert it to crlf eol
+otherwise it is broken!
+
diff --git a/gem/t2.lua b/gem/t2.lua
new file mode 100644
index 0000000..a81ed73
--- /dev/null
+++ b/gem/t2.lua
@@ -0,0 +1,36 @@
+source = {}
+sink = {}
+pump = {}
+filter = {}
+
+-- filter.chain
+dofile("ex3.lua")
+
+-- normalize
+require"gem"
+eol = gem.eol
+dofile("ex2.lua")
+
+-- encode
+require"mime"
+encode = mime.encode
+
+-- wrap
+wrap = mime.wrap
+
+-- source.chain
+dofile("ex6.lua")
+
+-- source.file
+dofile("ex5.lua")
+
+-- sink.file
+require"ltn12"
+sink.file = ltn12.sink.file
+
+-- pump.all
+dofile("ex10.lua")
+
+-- run test
+CRLF = "\013\010"
+dofile("ex4.lua")
diff --git a/gem/t2.txt b/gem/t2.txt
new file mode 100644
index 0000000..f484fe8
--- /dev/null
+++ b/gem/t2.txt
@@ -0,0 +1,4 @@
+esse é um texto com acentos
+quoted-printable tem que quebrar linhas longas, com mais que 76 linhas de texto
+fora que as quebras de linhas têm que ser normalizadas
+vamos ver o que dá isso aqui
diff --git a/gem/t2gt.qp b/gem/t2gt.qp
new file mode 100644
index 0000000..355a845
--- /dev/null
+++ b/gem/t2gt.qp
@@ -0,0 +1,5 @@
+esse =E9 um texto com acentos
+quoted-printable tem que quebrar linhas longas, com mais que 76 linhas de t=
+exto
+fora que as quebras de linhas t=EAm que ser normalizadas
+vamos ver o que d=E1 isso aqui
diff --git a/gem/t3.lua b/gem/t3.lua
new file mode 100644
index 0000000..4bb98ba
--- /dev/null
+++ b/gem/t3.lua
@@ -0,0 +1,25 @@
+source = {}
+sink = {}
+pump = {}
+filter = {}
+
+-- source.file
+dofile("ex5.lua")
+
+-- sink.table
+dofile("ex7.lua")
+
+-- sink.chain
+require"ltn12"
+sink.chain = ltn12.sink.chain
+
+-- normalize
+require"gem"
+eol = gem.eol
+dofile("ex2.lua")
+
+-- pump.all
+dofile("ex10.lua")
+
+-- run test
+dofile("ex8.lua")
diff --git a/gem/t4.lua b/gem/t4.lua
new file mode 100644
index 0000000..8b8071c
--- /dev/null
+++ b/gem/t4.lua
@@ -0,0 +1,10 @@
+source = {}
+sink = {}
+pump = {}
+filter = {}
+
+-- source.file
+dofile("ex5.lua")
+
+-- run test
+dofile("ex9.lua")
diff --git a/gem/t5.lua b/gem/t5.lua
new file mode 100644
index 0000000..7c569ea
--- /dev/null
+++ b/gem/t5.lua
@@ -0,0 +1,30 @@
+source = {}
+sink = {}
+pump = {}
+filter = {}
+
+-- source.chain
+dofile("ex6.lua")
+
+-- source.file
+dofile("ex5.lua")
+
+-- encode
+require"mime"
+encode = mime.encode
+
+-- sink.chain
+require"ltn12"
+sink.chain = ltn12.sink.chain
+
+-- wrap
+wrap = mime.wrap
+
+-- sink.file
+sink.file = ltn12.sink.file
+
+-- pump.all
+dofile("ex10.lua")
+
+-- run test
+dofile("ex11.lua")
diff --git a/gem/test.lua b/gem/test.lua
new file mode 100644
index 0000000..a937b9a
--- /dev/null
+++ b/gem/test.lua
@@ -0,0 +1,46 @@
+function readfile(n)
+ local f = io.open(n, "rb")
+ local s = f:read("*a")
+ f:close()
+ return s
+end
+
+lf = readfile("t1lf.txt")
+os.remove("t1crlf.txt")
+os.execute("lua t1.lua < t1lf.txt > t1crlf.txt")
+crlf = readfile("t1crlf.txt")
+assert(crlf == string.gsub(lf, "\010", "\013\010"), "broken")
+
+gt = readfile("t2gt.qp")
+os.remove("t2.qp")
+os.execute("lua t2.lua < t2.txt > t2.qp")
+t2 = readfile("t2.qp")
+assert(gt == t2, "broken")
+
+os.remove("t1crlf.txt")
+os.execute("lua t3.lua < t1lf.txt > t1crlf.txt")
+crlf = readfile("t1crlf.txt")
+assert(crlf == string.gsub(lf, "\010", "\013\010"), "broken")
+
+t = readfile("test.lua")
+os.execute("lua t4.lua < test.lua > t")
+t2 = readfile("t")
+assert(t == t2, "broken")
+
+os.remove("output.b64")
+gt = readfile("gt.b64")
+os.execute("lua t5.lua")
+t5 = readfile("output.b64")
+assert(gt == t5, "failed")
+
+print("1 2 5 6 10 passed")
+print("2 3 4 5 6 10 passed")
+print("2 5 6 7 8 10 passed")
+print("5 9 passed")
+print("5 6 10 11 passed")
+
+os.remove("t")
+os.remove("t2.qp")
+os.remove("t1crlf.txt")
+os.remove("t11.b64")
+os.remove("output.b64")
diff --git a/linux.cmd b/linux.cmd
new file mode 100644
index 0000000..bd59adc
--- /dev/null
+++ b/linux.cmd
@@ -0,0 +1 @@
+make PLAT=linux DEBUG=DEBUG LUAINC_linux_base=/home/diego/build/linux/include LUAPREFIX_linux=/home/diego/build/linux
diff --git a/logo.ps b/logo.ps
new file mode 100644
index 0000000..8b5809a
--- /dev/null
+++ b/logo.ps
@@ -0,0 +1,210 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: Lua logo
+%%Creator: lua@tecgraf.puc-rio.br
+%%CreationDate: Wed Nov 29 19:04:04 EDT 2000
+%%BoundingBox: -45 0 1035 1080
+%%Pages: 1
+%%EndComments
+%%EndProlog
+
+%------------------------------------------------------------------------------
+%
+% Copyright (C) 1998-2000. All rights reserved.
+% Graphic design by Alexandre Nakonechny (nako@openlink.com.br).
+% PostScript programming by the Lua team (lua@tecgraf.puc-rio.br).
+%
+% Permission is hereby granted, without written agreement and without license
+% or royalty fees, to use, copy, and distribute this logo for any purpose,
+% including commercial applications, subject to the following conditions:
+%
+% * The origin of this logo must not be misrepresented; you must not
+% claim that you drew the original logo. We recommend that you give credit
+% to the graphics designer in all printed matter that includes the logo.
+%
+% * The only modification you can make is to adapt the orbiting text to
+% your product name.
+%
+% * The logo can be used in any scale as long as the relative proportions
+% of its elements are maintained.
+%
+%------------------------------------------------------------------------------
+
+/LABEL (tekcoS) def
+
+%-- DO NOT CHANGE ANYTHING BELOW THIS LINE ------------------------------------
+
+/PLANETCOLOR {0 0 0.5 setrgbcolor} bind def
+/HOLECOLOR {1.0 setgray} bind def
+/ORBITCOLOR {0.5 setgray} bind def
+/LOGOFONT {/Helvetica 0.90} def
+/LABELFONT {/Helvetica 0.36} def
+
+%------------------------------------------------------------------------------
+
+/MOONCOLOR {PLANETCOLOR} bind def
+/LOGOCOLOR {HOLECOLOR} bind def
+/LABELCOLOR {ORBITCOLOR} bind def
+
+/LABELANGLE 325 def
+/LOGO (Lua) def
+
+/DASHANGLE 10 def
+/HALFDASHANGLE DASHANGLE 2 div def
+
+% moon radius. planet radius is 1.
+/r 1 2 sqrt 2 div sub def
+
+/D {0 360 arc fill} bind def
+/F {exch findfont exch scalefont setfont} bind def
+
+% place it nicely on the paper
+/RESOLUTION 1024 def
+RESOLUTION 2 div dup translate
+RESOLUTION 2 div 2 sqrt div dup scale
+
+%-------------------------------------------------------------------- planet --
+PLANETCOLOR
+0 0 1 D
+
+%---------------------------------------------------------------------- hole --
+HOLECOLOR
+1 2 r mul sub dup r D
+
+%---------------------------------------------------------------------- moon --
+MOONCOLOR
+1 1 r D
+
+%---------------------------------------------------------------------- logo --
+LOGOCOLOR
+LOGOFONT
+F
+LOGO stringwidth pop 2 div neg
+-0.5 moveto
+LOGO show
+
+%------------------------------------------------------------------------------
+% based on code from Blue Book Program 10, on pages 167--169
+% available at ftp://ftp.adobe.com/pub/adobe/displaypostscript/bluebook.shar
+
+% str ptsize centerangle radius outsidecircletext --
+/outsidecircletext {
+ circtextdict begin
+ /radius exch def
+ /centerangle exch def
+ /ptsize exch def
+ /str exch def
+
+ gsave
+ str radius ptsize findhalfangle
+ centerangle
+ add rotate
+ str
+ { /charcode exch def
+ ( ) dup 0 charcode put outsideplacechar
+ } forall
+
+ grestore
+ end
+} def
+
+% string radius ptsize findhalfangle halfangle
+/findhalfangle {
+ 4 div add
+ exch
+ stringwidth pop 2 div
+ exch
+ 2 mul 3.1415926535 mul div 360 mul
+} def
+
+/circtextdict 16 dict def
+circtextdict begin
+
+ /outsideplacechar {
+ /char exch def
+ /halfangle char radius ptsize findhalfangle def
+ gsave
+ halfangle neg rotate
+ 1.4 0 translate
+ 90 rotate
+ char stringwidth pop 2 div neg 0 moveto
+ char show
+ grestore
+ halfangle 2 mul neg rotate
+ } def
+
+end
+
+%--------------------------------------------------------------------- label --
+LABELFONT
+F
+
+/LABELSIZE LABELFONT exch pop def
+/LABELRADIUS LABELSIZE 3 div 1 r add sub neg 1.02 mul def
+
+
+/HALFANGLE
+ LABEL LABELRADIUS LABELSIZE findhalfangle
+ HALFDASHANGLE div ceiling HALFDASHANGLE mul
+def
+
+/LABELANGLE
+ 60 LABELANGLE HALFANGLE sub
+ lt
+ {
+ HALFANGLE
+ HALFANGLE DASHANGLE div floor DASHANGLE mul
+ eq
+ {LABELANGLE DASHANGLE div ceiling DASHANGLE mul}
+ {LABELANGLE HALFDASHANGLE sub DASHANGLE div round DASHANGLE mul HALFDASHANGLE add}
+ ifelse
+ }
+ {HALFANGLE 60 add}
+ ifelse
+def
+
+LABELCOLOR
+LABEL
+LABELSIZE
+LABELANGLE
+LABELRADIUS
+outsidecircletext
+
+%--------------------------------------------------------------------- orbit --
+ORBITCOLOR
+0.03 setlinewidth
+[1 r add 3.1415926535 180 div HALFDASHANGLE mul mul] 0 setdash
+newpath
+0 0
+1 r add
+3 copy
+30
+LABELANGLE HALFANGLE add
+arcn
+stroke
+60
+LABELANGLE HALFANGLE sub
+2 copy
+lt {arc stroke} {4 {pop} repeat} ifelse
+
+%------------------------------------------------------------------ copyright --
+/COPYRIGHT
+(Graphic design by A. Nakonechny. Copyright (c) 1998, All rights reserved.)
+def
+
+LABELCOLOR
+LOGOFONT
+32 div
+F
+2 sqrt 0.99 mul
+dup
+neg
+moveto
+COPYRIGHT
+90 rotate
+%show
+
+%---------------------------------------------------------------------- done --
+showpage
+
+%%Trailer
+%%EOF
diff --git a/ltn012.wiki b/ltn012.wiki
new file mode 100644
index 0000000..96b13ae
--- /dev/null
+++ b/ltn012.wiki
@@ -0,0 +1,393 @@
+===Filters, sources and sinks: design, motivation and examples===
+==or Functional programming for the rest of us==
+by DiegoNehab
+
+{{{
+
+}}}
+
+===Abstract===
+Certain operations can be implemented in the form of filters. A filter is a function that processes data received in consecutive function calls, returning partial results chunk by chunk. Examples of operations that can be implemented as filters include the end-of-line normalization for text, Base64 and Quoted-Printable transfer content encodings, the breaking of text into lines, SMTP byte stuffing, and there are many others. Filters become even more powerful when we allow them to be chained together to create composite filters. Filters can be seen as middle nodes in a chain of data transformations. Sources an sinks are the corresponding end points of these chains. A source is a function that produces data, chunk by chunk, and a sink is a function that takes data, chunk by chunk. In this technical note, we define an elegant interface for filters, sources, sinks and chaining. We evolve our interface progressively, until we reach a high degree of generality. We discuss difficulties that arise during the implementation of this interface and we provide solutions and examples.
+
+===Introduction===
+
+Applications sometimes have too much information to process to fit in memory and are thus forced to process data in smaller parts. Even when there is enough memory, processing all the data atomically may take long enough to frustrate a user that wants to interact with the application. Furthermore, complex transformations can often be defined as series of simpler operations. Several different complex transformations might share the same simpler operations, so that an uniform interface to combine them is desirable. The following concepts constitute our solution to these problems.
+
+''Filters'' are functions that accept successive chunks of input, and produce successive chunks of output. Furthermore, the result of concatenating all the output data is the same as the result of applying the filter over the concatenation of the input data. As a consequence, boundaries are irrelevant: filters have to handle input data split arbitrarily by the user.
+
+A ''chain'' is a function that combines the effect of two (or more) other functions, but whose interface is indistinguishable from the interface of one of its components. Thus, a chained filter can be used wherever an atomic filter can be used. However, its effect on data is the combined effect of its component filters. Note that, as a consequence, chains can be chained themselves to create arbitrarily complex operations that can be used just like atomic operations.
+
+Filters can be seen as internal nodes in a network through which data flows, potentially being transformed along its way. Chains connect these nodes together. To complete the picture, we need ''sources'' and ''sinks'' as initial and final nodes of the network, respectively. Less abstractly, a source is a function that produces new data every time it is called. On the other hand, sinks are functions that give a final destination to the data they receive. Naturally, sources and sinks can be chained with filters.
+
+Finally, filters, chains, sources, and sinks are all passive entities: they need to be repeatedly called in order for something to happen. ''Pumps'' provide the driving force that pushes data through the network, from a source to a sink.
+
+ Hopefully, these concepts will become clear with examples. In the following sections, we start with simplified interfaces, which we improve several times until we can find no obvious shortcomings. The evolution we present is not contrived: it follows the steps we followed ourselves as we consolidated our understanding of these concepts.
+
+== A concrete example ==
+
+Some data transformations are easier to implement as filters than others. Examples of operations that can be implemented as filters include the end-of-line normalization for text, the Base64 and Quoted-Printable transfer content encodings, the breaking of text into lines, SMTP byte stuffing, and many others. Let's use the end-of-line normalization as an example to define our initial filter interface. We later discuss why the implementation might not be trivial.
+
+Assume we are given text in an unknown end-of-line convention (including possibly mixed conventions) out of the commonly found Unix (LF), Mac OS (CR), and DOS (CRLF) conventions. We would like to be able to write code like the following:
+ {{{
+input = source.chain(source.file(io.stdin), normalize("\r\n"))
+output = sink.file(io.stdout)
+pump(input, output)
+}}}
+
+This program should read data from the standard input stream and normalize the end-of-line markers to the canonic CRLF marker defined by the MIME standard, finally sending the results to the standard output stream. For that, we use a ''file source'' to produce data from standard input, and chain it with a filter that normalizes the data. The pump then repeatedly gets data from the source, and moves it to the ''file sink'' that sends it to standard output.
+
+To make the discussion even more concrete, we start by discussing the implementation of the normalization filter. The {{normalize}} ''factory'' is a function that creates such a filter. Our initial filter interface is as follows: the filter receives a chunk of input data, and returns a chunk of processed data. When there is no more input data, the user notifies the filter by invoking it with a {{nil}} chunk. The filter then returns the final chunk of processed data.
+
+Although the interface is extremely simple, the implementation doesn't seem so obvious. Any filter respecting this interface needs to keep some kind of context between calls. This is because chunks can be broken between the CR and LF characters marking the end of a line. This need for context storage is what motivates the use of factories: each time the factory is called, it returns a filter with its own context so that we can have several independent filters being used at the same time. For the normalization filter, we know that the obvious solution (i.e. concatenating all the input into the context before producing any output) is not good enough, so we will have to find another way.
+
+We will break the implementation in two parts: a low-level filter, and a factory of high-level filters. The low-level filter will be implemented in C and will not carry any context between function calls. The high-level filter factory, implemented in Lua, will create and return a high-level filter that keeps whatever context the low-level filter needs, but isolates the user from its internal details. That way, we take advantage of C's efficiency to perform the dirty work, and take advantage of Lua's simplicity for the bookkeeping.
+
+==The Lua part of the implementation==
+
+Below is the implementation of the factory of high-level end-of-line normalization filters:
+ {{{
+function filter.cycle(low, ctx, extra)
+ return function(chunk)
+ local ret
+ ret, ctx = low(ctx, chunk, extra)
+ return ret
+ end
+end
+
+function normalize(marker)
+ return cycle(eol, 0, marker)
+end
+}}}
+
+The {{normalize}} factory simply calls a more generic factory, the {{cycle}} factory. This factory receives a low-level filter, an initial context and some extra value and returns the corresponding high-level filter. Each time the high level filer is called with a new chunk, it calls the low-level filter passing the previous context, the new chunk and the extra argument. The low-level filter produces the chunk of processed data and a new context. Finally, the high-level filter updates its internal context and returns the processed chunk of data to the user. It is the low-level filter that does all the work. Notice that this implementation takes advantage of the Lua 5.0 lexical scoping rules to store the context locally, between function calls.
+
+Moving to the low-level filter, we notice there is no perfect solution to the end-of-line marker normalization problem itself. The difficulty comes from an inherent ambiguity on the definition of empty lines within mixed input. However, the following solution works well for any consistent input, as well as for non-empty lines in mixed input. It also does a reasonable job with empty lines and serves as a good example of how to implement a low-level filter.
+
+Here is what we do: CR and LF are considered candidates for line break. We issue ''one'' end-of-line line marker if one of the candidates is seen alone, or followed by a ''different'' candidate. That is, CR CR and LF LF issue two end of line markers each, but CR LF and LF CR issue only one marker. This idea takes care of Mac OS, Mac OS X, VMS and Unix, DOS and MIME, as well as probably other more obscure conventions.
+
+==The C part of the implementation==
+
+The low-level filter is divided into two simple functions. The inner function actually does the conversion. It takes each input character in turn, deciding what to output and how to modify the context. The context tells if the last character seen was a candidate and, if so, which candidate it was.
+ {{{
+#define candidate(c) (c == CR || c == LF)
+static int process(int c, int last, const char *marker, luaL_Buffer *buffer) {
+ if (candidate(c)) {
+ if (candidate(last)) {
+ if (c == last) luaL_addstring(buffer, marker);
+ return 0;
+ } else {
+ luaL_addstring(buffer, marker);
+ return c;
+ }
+ } else {
+ luaL_putchar(buffer, c);
+ return 0;
+ }
+}
+}}}
+
+The inner function makes use of Lua's auxiliary library's buffer interface for its efficiency and ease of use. The outer function simply interfaces with Lua. It receives the context and the input chunk (as well as an optional end-of-line marker), and returns the transformed output and the new context.
+ {{{
+static int eol(lua_State *L) {
+ int ctx = luaL_checkint(L, 1);
+ size_t isize = 0;
+ const char *input = luaL_optlstring(L, 2, NULL, &isize);
+ const char *last = input + isize;
+ const char *marker = luaL_optstring(L, 3, CRLF);
+ luaL_Buffer buffer;
+ luaL_buffinit(L, &buffer);
+ if (!input) {
+ lua_pushnil(L);
+ lua_pushnumber(L, 0);
+ return 2;
+ }
+ while (input < last)
+ ctx = process(*input++, ctx, marker, &buffer);
+ luaL_pushresult(&buffer);
+ lua_pushnumber(L, ctx);
+ return 2;
+}
+}}}
+
+Notice that if the input chunk is {{nil}}, the operation is considered to be finished. In that case, the loop will not execute a single time and the context is reset to the initial state. This allows the filter to be reused indefinitely. It is a good idea to write filters like this, when possible.
+
+Besides the end-of-line normalization filter shown above, many other filters can be implemented with the same ideas. Examples include Base64 and Quoted-Printable transfer content encodings, the breaking of text into lines, SMTP byte stuffing etc. The challenging part is to decide what will be the context. For line breaking, for instance, it could be the number of bytes left in the current line. For Base64 encoding, it could be the bytes that remain in the division of the input into 3-byte atoms.
+
+===Chaining===
+
+Filters become more powerful when the concept of chaining is introduced. Suppose you have a filter for Quoted-Printable encoding and you want to encode some text. According to the standard, the text has to be normalized into its canonic form prior to encoding. A nice interface that simplifies this task is a factory that creates a composite filter that passes data through multiple filters, but that can be used wherever a primitive filter is used.
+ {{{
+local function chain2(f1, f2)
+ return function(chunk)
+ local ret = f2(f1(chunk))
+ if chunk then return ret
+ else return ret .. f2() end
+ end
+end
+
+function filter.chain(...)
+ local arg = {...}
+ local f = arg[1]
+ for i = 2, #arg do
+ f = chain2(f, arg[i])
+ end
+ return f
+end
+
+local chain = filter.chain(normalize("\r\n"), encode("quoted-printable"))
+while 1 do
+ local chunk = io.read(2048)
+ io.write(chain(chunk))
+ if not chunk then break end
+end
+}}}
+
+The chaining factory is very simple. All it does is return a function that passes data through all filters and returns the result to the user. It uses the simpler auxiliary function that knows how to chain two filters together. In the auxiliary function, special care must be taken if the chunk is final. This is because the final chunk notification has to be pushed through both filters in turn. Thanks to the chain factory, it is easy to perform the Quoted-Printable conversion, as the above example shows.
+
+===Sources, sinks, and pumps===
+
+As we noted in the introduction, the filters we introduced so far act as the internal nodes in a network of transformations. Information flows from node to node (or rather from one filter to the next) and is transformed on its way out. Chaining filters together is the way we found to connect nodes in the network. But what about the end nodes? In the beginning of the network, we need a node that provides the data, a source. In the end of the network, we need a node that takes in the data, a sink.
+
+==Sources==
+
+We start with two simple sources. The first is the {{empty}} source: It simply returns no data, possibly returning an error message. The second is the {{file}} source, which produces the contents of a file in a chunk by chunk fashion, closing the file handle when done.
+ {{{
+function source.empty(err)
+ return function()
+ return nil, err
+ end
+end
+
+function source.file(handle, io_err)
+ if handle then
+ return function()
+ local chunk = handle:read(2048)
+ if not chunk then handle:close() end
+ return chunk
+ end
+ else return source.empty(io_err or "unable to open file") end
+end
+}}}
+
+A source returns the next chunk of data each time it is called. When there is no more data, it just returns {{nil}}. If there is an error, the source can inform the caller by returning {{nil}} followed by an error message. Adrian Sietsma noticed that, although not on purpose, the interface for sources is compatible with the idea of iterators in Lua 5.0. That is, a data source can be nicely used in conjunction with {{for}} loops. Using our file source as an iterator, we can rewrite our first example:
+ {{{
+local process = normalize("\r\n")
+for chunk in source.file(io.stdin) do
+ io.write(process(chunk))
+end
+io.write(process(nil))
+}}}
+
+Notice that the last call to the filter obtains the last chunk of processed data. The loop terminates when the source returns {{nil}} and therefore we need that final call outside of the loop.
+
+==Maintaining state between calls==
+
+It is often the case that a source needs to change its behavior after some event. One simple example would be a file source that wants to make sure it returns {{nil}} regardless of how many times it is called after the end of file, avoiding attempts to read past the end of the file. Another example would be a source that returns the contents of several files, as if they were concatenated, moving from one file to the next until the end of the last file is reached.
+
+One way to implement this kind of source is to have the factory declare extra state variables that the source can use via lexical scoping. Our file source could set the file handle itself to {{nil}} when it detects the end-of-file. Then, every time the source is called, it could check if the handle is still valid and act accordingly:
+ {{{
+function source.file(handle, io_err)
+ if handle then
+ return function()
+ if not handle then return nil end
+ local chunk = handle:read(2048)
+ if not chunk then
+ handle:close()
+ handle = nil
+ end
+ return chunk
+ end
+ else return source.empty(io_err or "unable to open file") end
+end
+}}}
+
+Another way to implement this behavior involves a change in the source interface to makes it more flexible. Let's allow a source to return a second value, besides the next chunk of data. If the returned chunk is {{nil}}, the extra return value tells us what happened. A second {{nil}} means that there is just no more data and the source is empty. Any other value is considered to be an error message. On the other hand, if the chunk was ''not'' {{nil}}, the second return value tells us whether the source wants to be replaced. If it is {{nil}}, we should proceed using the same source. Otherwise it has to be another source, which we have to use from then on, to get the remaining data.
+
+This extra freedom is good for someone writing a source function, but it is a pain for those that have to use it. Fortunately, given one of these ''fancy'' sources, we can transform it into a simple source that never needs to be replaced, using the following factory.
+ {{{
+function source.simplify(src)
+ return function()
+ local chunk, err_or_new = src()
+ src = err_or_new or src
+ if not chunk then return nil, err_or_new
+ else return chunk end
+ end
+end
+}}}
+
+The simplification factory allows us to write fancy sources and use them as if they were simple. Therefore, our next functions will only produce simple sources, and functions that take sources will assume they are simple.
+
+Going back to our file source, the extended interface allows for a more elegant implementation. The new source just asks to be replaced by an empty source as soon as there is no more data. There is no repeated checking of the handle. To make things simpler to the user, the factory itself simplifies the the fancy file source before returning it to the user:
+ {{{
+function source.file(handle, io_err)
+ if handle then
+ return source.simplify(function()
+ local chunk = handle:read(2048)
+ if not chunk then
+ handle:close()
+ return "", source.empty()
+ end
+ return chunk
+ end)
+ else return source.empty(io_err or "unable to open file") end
+end
+}}}
+
+We can make these ideas even more powerful if we use a new feature of Lua 5.0: coroutines. Coroutines suffer from a great lack of advertisement, and I am going to play my part here. Just like lexical scoping, coroutines taste odd at first, but once you get used with the concept, it can save your day. I have to admit that using coroutines to implement our file source would be overkill, so let's implement a concatenated source factory instead.
+ {{{
+function source.cat(...)
+ local arg = {...}
+ local co = coroutine.create(function()
+ local i = 1
+ while i <= #arg do
+ local chunk, err = arg[i]()
+ if chunk then coroutine.yield(chunk)
+ elseif err then return nil, err
+ else i = i + 1 end
+ end
+ end)
+ return function()
+ return shift(coroutine.resume(co))
+ end
+end
+}}}
+
+The factory creates two functions. The first is an auxiliary that does all the work, in the form of a coroutine. It reads a chunk from one of the sources. If the chunk is {{nil}}, it moves to the next source, otherwise it just yields returning the chunk. When it is resumed, it continues from where it stopped and tries to read the next chunk. The second function is the source itself, and just resumes the execution of the auxiliary coroutine, returning to the user whatever chunks it returns (skipping the first result that tells us if the coroutine terminated). Imagine writing the same function without coroutines and you will notice the simplicity of this implementation. We will use coroutines again when we make the filter interface more powerful.
+
+==Chaining Sources==
+
+What does it mean to chain a source with a filter? The most useful interpretation is that the combined source-filter is a new source that produces data and passes it through the filter before returning it. Here is a factory that does it:
+ {{{
+function source.chain(src, f)
+ return source.simplify(function()
+ local chunk, err = src()
+ if not chunk then return f(nil), source.empty(err)
+ else return f(chunk) end
+ end)
+end
+}}}
+
+Our motivating example in the introduction chains a source with a filter. The idea of chaining a source with a filter is useful when one thinks about functions that might get their input data from a source. By chaining a simple source with one or more filters, the same function can be provided with filtered data even though it is unaware of the filtering that is happening behind its back.
+
+==Sinks==
+
+Just as we defined an interface for an initial source of data, we can also define an interface for a final destination of data. We call any function respecting that interface a ''sink''. Below are two simple factories that return sinks. The table factory creates a sink that stores all obtained data into a table. The data can later be efficiently concatenated into a single string with the {{table.concat}} library function. As another example, we introduce the {{null}} sink: A sink that simply discards the data it receives.
+ {{{
+function sink.table(t)
+ t = t or {}
+ local f = function(chunk, err)
+ if chunk then table.insert(t, chunk) end
+ return 1
+ end
+ return f, t
+end
+
+local function null()
+ return 1
+end
+
+function sink.null()
+ return null
+end
+}}}
+
+Sinks receive consecutive chunks of data, until the end of data is notified with a {{nil}} chunk. An error is notified by an extra argument giving an error message after the {{nil}} chunk. If a sink detects an error itself and wishes not to be called again, it should return {{nil}}, optionally followed by an error message. A return value that is not {{nil}} means the source will accept more data. Finally, just as sources can choose to be replaced, so can sinks, following the same interface. Once again, it is easy to implement a {{sink.simplify}} factory that transforms a fancy sink into a simple sink.
+
+As an example, let's create a source that reads from the standard input, then chain it with a filter that normalizes the end-of-line convention and let's use a sink to place all data into a table, printing the result in the end.
+ {{{
+local load = source.chain(source.file(io.stdin), normalize("\r\n"))
+local store, t = sink.table()
+while 1 do
+ local chunk = load()
+ store(chunk)
+ if not chunk then break end
+end
+print(table.concat(t))
+}}}
+
+Again, just as we created a factory that produces a chained source-filter from a source and a filter, it is easy to create a factory that produces a new sink given a sink and a filter. The new sink passes all data it receives through the filter before handing it in to the original sink. Here is the implementation:
+ {{{
+function sink.chain(f, snk)
+ return function(chunk, err)
+ local r, e = snk(f(chunk))
+ if not r then return nil, e end
+ if not chunk then return snk(nil, err) end
+ return 1
+ end
+end
+}}}
+
+==Pumps==
+
+There is a while loop that has been around for too long in our examples. It's always there because everything that we designed so far is passive. Sources, sinks, filters: None of them will do anything on their own. The operation of pumping all data a source can provide into a sink is so common that we will provide a couple helper functions to do that for us.
+ {{{
+function pump.step(src, snk)
+ local chunk, src_err = src()
+ local ret, snk_err = snk(chunk, src_err)
+ return chunk and ret and not src_err and not snk_err, src_err or snk_err
+end
+
+function pump.all(src, snk, step)
+ step = step or pump.step
+ while true do
+ local ret, err = step(src, snk)
+ if not ret then return not err, err end
+ end
+end
+}}}
+
+The {{pump.step}} function moves one chunk of data from the source to the sink. The {{pump.all}} function takes an optional {{step}} function and uses it to pump all the data from the source to the sink. We can now use everything we have to write a program that reads a binary file from disk and stores it in another file, after encoding it to the Base64 transfer content encoding:
+ {{{
+local load = source.chain(
+ source.file(io.open("input.bin", "rb")),
+ encode("base64")
+)
+local store = sink.chain(
+ wrap(76),
+ sink.file(io.open("output.b64", "w")),
+)
+pump.all(load, store)
+}}}
+
+The way we split the filters here is not intuitive, on purpose. Alternatively, we could have chained the Base64 encode filter and the line-wrap filter together, and then chain the resulting filter with either the file source or the file sink. It doesn't really matter.
+
+===One last important change===
+
+Turns out we still have a problem. When David Burgess was writing his gzip filter, he noticed that the decompression filter can explode a small input chunk into a huge amount of data. Although we wished we could ignore this problem, we soon agreed we couldn't. The only solution is to allow filters to return partial results, and that is what we chose to do. After invoking the filter to pass input data, the user now has to loop invoking the filter to find out if it has more output data to return. Note that these extra calls can't pass more data to the filter.
+
+More specifically, after passing a chunk of input data to a filter and collecting the first chunk of output data, the user invokes the filter repeatedly, passing the empty string, to get extra output chunks. When the filter itself returns an empty string, the user knows there is no more output data, and can proceed to pass the next input chunk. In the end, after the user passes a {{nil}} notifying the filter that there is no more input data, the filter might still have produced too much output data to return in a single chunk. The user has to loop again, this time passing {{nil}} each time, until the filter itself returns {{nil}} to notify the user it is finally done.
+
+Most filters won't need this extra freedom. Fortunately, the new filter interface is easy to implement. In fact, the end-of-line translation filter we created in the introduction already conforms to it. On the other hand, the chaining function becomes much more complicated. If it wasn't for coroutines, I wouldn't be happy to implement it. Let me know if you can find a simpler implementation that does not use coroutines!
+ {{{
+local function chain2(f1, f2)
+ local co = coroutine.create(function(chunk)
+ while true do
+ local filtered1 = f1(chunk)
+ local filtered2 = f2(filtered1)
+ local done2 = filtered1 and ""
+ while true do
+ if filtered2 == "" or filtered2 == nil then break end
+ coroutine.yield(filtered2)
+ filtered2 = f2(done2)
+ end
+ if filtered1 == "" then chunk = coroutine.yield(filtered1)
+ elseif filtered1 == nil then return nil
+ else chunk = chunk and "" end
+ end
+ end)
+ return function(chunk)
+ local _, res = coroutine.resume(co, chunk)
+ return res
+ end
+end
+}}}
+
+Chaining sources also becomes more complicated, but a similar solution is possible with coroutines. Chaining sinks is just as simple as it has always been. Interestingly, these modifications do not have a measurable negative impact in the the performance of filters that didn't need the added flexibility. They do severely improve the efficiency of filters like the gzip filter, though, and that is why we are keeping them.
+
+===Final considerations===
+
+These ideas were created during the development of {{LuaSocket}}[http://www.tecgraf.puc-rio.br/luasocket] 2.0, and are available as the LTN12 module. As a result, {{LuaSocket}}[http://www.tecgraf.puc-rio.br/luasocket] implementation was greatly simplified and became much more powerful. The MIME module is especially integrated to LTN12 and provides many other filters. We felt these concepts deserved to be made public even to those that don't care about {{LuaSocket}}[http://www.tecgraf.puc-rio.br/luasocket], hence the LTN.
+
+One extra application that deserves mentioning makes use of an identity filter. Suppose you want to provide some feedback to the user while a file is being downloaded into a sink. Chaining the sink with an identity filter (a filter that simply returns the received data unaltered), you can update a progress counter on the fly. The original sink doesn't have to be modified. Another interesting idea is that of a T sink: A sink that sends data to two other sinks. In summary, there appears to be enough room for many other interesting ideas.
+
+In this technical note we introduced filters, sources, sinks, and pumps. These are useful tools for data processing in general. Sources provide a simple abstraction for data acquisition. Sinks provide an abstraction for final data destinations. Filters define an interface for data transformations. The chaining of filters, sources and sinks provides an elegant way to create arbitrarily complex data transformation from simpler transformations. Pumps just put the machinery to work.
diff --git a/ltn013.wiki b/ltn013.wiki
new file mode 100644
index 0000000..a622424
--- /dev/null
+++ b/ltn013.wiki
@@ -0,0 +1,194 @@
+===Using finalized exceptions===
+==or How to get rid of all those if statements==
+by DiegoNehab
+
+{{{
+
+}}}
+
+===Abstract===
+This little LTN describes a simple exception scheme that greatly simplifies error checking in Lua programs. All the needed functionality ships standard with Lua, but is hidden between the {{assert}} and {{pcall}} functions. To make it more evident, we stick to a convenient standard (you probably already use anyways) for Lua function return values, and define two very simple helper functions (either in C or in Lua itself).
+
+===Introduction===
+
+Most Lua functions return {{nil}} in case of error, followed by a message describing the error. If you don't use this convention, you probably have good reasons. Hopefully, after reading on, you will realize your reasons are not good enough.
+
+If you are like me, you hate error checking. Most nice little code snippets that look beautiful when you first write them lose some of their charm when you add all that error checking code. Yet, error checking is as important as the rest of the code. How sad.
+
+Even if you stick to a return convention, any complex task involving several function calls makes error checking both boring and error-prone (do you see the ''error'' below?)
+ {{{
+function task(arg1, arg2, ...)
+ local ret1, err = task1(arg1)
+ if not ret1 then
+ cleanup1()
+ return nil, error
+ end
+ local ret2, err = task2(arg2)
+ if not ret then
+ cleanup2()
+ return nil, error
+ end
+ ...
+end
+}}}
+
+The standard {{assert}} function provides an interesting alternative. To use it, simply nest every function call to be error checked with a call to {{assert}}. The {{assert}} function checks the value of its first argument. If it is {{nil}}, {{assert}} throws the second argument as an error message. Otherwise, {{assert}} lets all arguments through as if had not been there. The idea greatly simplifies error checking:
+ {{{
+function task(arg1, arg2, ...)
+ local ret1 = assert(task1(arg1))
+ local ret2 = assert(task2(arg2))
+ ...
+end
+}}}
+
+If any task fails, the execution is aborted by {{assert}} and the error message is displayed to the user as the cause of the problem. If no error happens, the task completes as before. There isn't a single {{if}} statement and this is great. However, there are some problems with the idea.
+
+First, the topmost {{task}} function doesn't respect the protocol followed by the lower-level tasks: It raises an error instead of returning {{nil}} followed by the error messages. Here is where the standard {{pcall}} comes in handy.
+ {{{
+function xtask(arg1, arg2, ...)
+ local ret1 = assert(task1(arg1))
+ local ret2 = assert(task2(arg2))
+ ...
+end
+
+function task(arg1, arg2, ...)
+ local ok, ret_or_err = pcall(xtask, arg1, arg2, ...)
+ if ok then return ret_or_err
+ else return nil, ret_or_err end
+end
+}}}
+
+Our new {{task}} function is well behaved. {{Pcall}} catches any error raised by the calls to {{assert}} and returns it after the status code. That way, errors don't get propagated to the user of the high level {{task}} function.
+
+These are the main ideas for our exception scheme, but there are still a few glitches to fix:
+
+ * Directly using {{pcall}} ruined the simplicity of the code;
+ * What happened to the cleanup function calls? What if we have to, say, close a file?
+ * {{Assert}} messes with the error message before raising the error (it adds line number information).
+
+Fortunately, all these problems are very easy to solve and that's what we do in the following sections.
+
+== Introducing the {{protect}} factory ==
+
+We used the {{pcall}} function to shield the user from errors that could be raised by the underlying implementation. Instead of directly using {{pcall}} (and thus duplicating code) every time we prefer a factory that does the same job:
+ {{{
+local function pack(ok, ...)
+ return ok, {...}
+end
+
+function protect(f)
+ return function(...)
+ local ok, ret = pack(pcall(f, ...))
+ if ok then return unpack(ret)
+ else return nil, ret[1] end
+ end
+end
+}}}
+
+The {{protect}} factory receives a function that might raise exceptions and returns a function that respects our return value convention. Now we can rewrite the top-level {{task}} function in a much cleaner way:
+ {{{
+task = protect(function(arg1, arg2, ...)
+ local ret1 = assert(task1(arg1))
+ local ret2 = assert(task2(arg2))
+ ...
+end)
+}}}
+
+The Lua implementation of the {{protect}} factory suffers with the creation of tables to hold multiple arguments and return values. It is possible (and easy) to implement the same function in C, without any table creation.
+ {{{
+static int safecall(lua_State *L) {
+ lua_pushvalue(L, lua_upvalueindex(1));
+ lua_insert(L, 1);
+ if (lua_pcall(L, lua_gettop(L) - 1, LUA_MULTRET, 0) != 0) {
+ lua_pushnil(L);
+ lua_insert(L, 1);
+ return 2;
+ } else return lua_gettop(L);
+}
+
+static int protect(lua_State *L) {
+ lua_pushcclosure(L, safecall, 1);
+ return 1;
+}
+}}}
+
+===The {{newtry}} factory===
+
+Let's solve the two remaining issues with a single shot and use a concrete example to illustrate the proposed solution. Suppose you want to write a function to download an HTTP document. You have to connect, send the request and read the reply. Each of these tasks can fail, but if something goes wrong after you connected, you have to close the connection before returning the error message.
+ {{{
+get = protect(function(host, path)
+ local c
+ -- create a try function with a finalizer to close the socket
+ local try = newtry(function()
+ if c then c:close() end
+ end)
+ -- connect and send request
+ c = try(connect(host, 80))
+ try(c:send("GET " .. path .. " HTTP/1.0\r\n\r\n"))
+ -- get headers
+ local h = {}
+ while 1 do
+ l = try(c:receive())
+ if l == "" then break end
+ table.insert(h, l)
+ end
+ -- get body
+ local b = try(c:receive("*a"))
+ c:close()
+ return b, h
+end)
+}}}
+
+The {{newtry}} factory returns a function that works just like {{assert}}. The differences are that the {{try}} function doesn't mess with the error message and it calls an optional ''finalizer'' before raising the error. In our example, the finalizer simply closes the socket.
+
+Even with a simple example like this, we see that the finalized exceptions simplified our life. Let's see what we gain in general, not just in this example:
+
+ * We don't need to declare dummy variables to hold error messages in case any ever shows up;
+ * We avoid using a variable to hold something that could either be a return value or an error message;
+ * We didn't have to use several ''if'' statements to check for errors;
+ * If an error happens, we know our finalizer is going to be invoked automatically;
+ * Exceptions get propagated, so we don't repeat these ''if'' statements until the error reaches the user.
+
+Try writing the same function without the tricks we used above and you will see that the code gets ugly. Longer sequences of operations with error checking would get even uglier. So let's implement the {{newtry}} function in Lua:
+ {{{
+function newtry(f)
+ return function(...)
+ if not arg[1] then
+ if f then f() end
+ error(arg[2], 0)
+ else
+ return ...
+ end
+ end
+end
+}}}
+
+Again, the implementation suffers from the creation of tables at each function call, so we prefer the C version:
+ {{{
+static int finalize(lua_State *L) {
+ if (!lua_toboolean(L, 1)) {
+ lua_pushvalue(L, lua_upvalueindex(1));
+ lua_pcall(L, 0, 0, 0);
+ lua_settop(L, 2);
+ lua_error(L);
+ return 0;
+ } else return lua_gettop(L);
+}
+
+static int do_nothing(lua_State *L) {
+ (void) L;
+ return 0;
+}
+
+static int newtry(lua_State *L) {
+ lua_settop(L, 1);
+ if (lua_isnil(L, 1))
+ lua_pushcfunction(L, do_nothing);
+ lua_pushcclosure(L, finalize, 1);
+ return 1;
+}
+}}}
+
+===Final considerations===
+
+The {{protect}} and {{newtry}} functions saved a ''lot'' of work in the implementation of {{LuaSocket}}[http://www.tecgraf.puc-rio.br/luasocket]. The size of some modules was cut in half by the these ideas. It's true the scheme is not as generic as the exception mechanism of programming languages like C++ or Java, but the power/simplicity ratio is favorable and I hope it serves you as well as it served {{LuaSocket}}.
diff --git a/luasocket-2.1-1.rockspec b/luasocket-2.1-1.rockspec
new file mode 100644
index 0000000..9c59abe
--- /dev/null
+++ b/luasocket-2.1-1.rockspec
@@ -0,0 +1,67 @@
+package = "LuaSocket"
+version = "2.1-1"
+source = {
+ url = "git://github.com/diegonehab/luasocket.git",
+ branch = "unstable"
+}
+description = {
+ summary = "Network support for the Lua language",
+ detailed = [[
+ LuaSocket is a Lua extension library that is composed by two parts: a C core
+ that provides support for the TCP and UDP transport layers, and a set of Lua
+ modules that add support for functionality commonly needed by applications
+ that deal with the Internet.
+ ]],
+ homepage = "http://luaforge.net/projects/luasocket/",
+ license = "MIT"
+}
+dependencies = {
+ "lua >= 5.1"
+}
+build = {
+ type = "make",
+ build_variables = {
+ PLAT="linux",
+ LUAINC_linux="$(LUA_INCDIR)"
+ },
+ install_variables = {
+ INSTALL_TOP_SHARE = "$(LUADIR)",
+ INSTALL_TOP_LIB = "$(LIBDIR)"
+ },
+ platforms = {
+ macosx = {
+ build_variables = {
+ PLAT="macosx",
+ LUAINC_macosx="$(LUA_INCDIR)"
+ }
+ },
+ windows={
+ type= "command",
+ build_command=
+ "set INCLUDE=$(LUA_INCDIR);%INCLUDE% &"..
+ "set LIB=$(LUA_LIBDIR);%LIB% &"..
+ "msbuild /p:\"VCBuildAdditionalOptions= /useenv\" luasocket.sln &"..
+ "mkdir mime & mkdir socket &"..
+ "cp src/mime.dll mime/core.dll &"..
+ "cp src/socket.dll socket/core.dll",
+ install= {
+ lib = {
+ ["mime.core"] = "mime/core.dll",
+ ["socket.core"] = "socket/core.dll"
+ },
+ lua = {
+ "src/ltn12.lua",
+ "src/mime.lua",
+ "src/socket.lua",
+ ["socket.headers"] = "src/headers.lua",
+ ["socket.ftp"] = "src/ftp.lua",
+ ["socket.http"] = "src/http.lua",
+ ["socket.smtp"] = "src/smtp.lua",
+ ["socket.tp"] = "src/tp.lua",
+ ["socket.url"] = "src/url.lua",
+ }
+ }
+ }
+ },
+ copy_directories = { "doc", "samples", "etc", "test" }
+}
diff --git a/luasocket.sln b/luasocket.sln
new file mode 100644
index 0000000..0e5cdc7
--- /dev/null
+++ b/luasocket.sln
@@ -0,0 +1,35 @@
+Microsoft Visual Studio Solution File, Format Version 12.00
+# Visual Studio 2012
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "socket", "socket.vcxproj", "{66E3CE14-884D-4AEA-9F20-15A0BEAF8C5A}"
+EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "mime", "mime.vcxproj", "{128E8BD0-174A-48F0-8771-92B1E8D18713}"
+EndProject
+Global
+ GlobalSection(SolutionConfigurationPlatforms) = preSolution
+ Debug|Win32 = Debug|Win32
+ Debug|x64 = Debug|x64
+ Release|Win32 = Release|Win32
+ Release|x64 = Release|x64
+ EndGlobalSection
+ GlobalSection(ProjectConfigurationPlatforms) = postSolution
+ {66E3CE14-884D-4AEA-9F20-15A0BEAF8C5A}.Debug|Win32.ActiveCfg = Debug|Win32
+ {66E3CE14-884D-4AEA-9F20-15A0BEAF8C5A}.Debug|Win32.Build.0 = Debug|Win32
+ {66E3CE14-884D-4AEA-9F20-15A0BEAF8C5A}.Debug|x64.ActiveCfg = Debug|x64
+ {66E3CE14-884D-4AEA-9F20-15A0BEAF8C5A}.Debug|x64.Build.0 = Debug|x64
+ {66E3CE14-884D-4AEA-9F20-15A0BEAF8C5A}.Release|Win32.ActiveCfg = Release|Win32
+ {66E3CE14-884D-4AEA-9F20-15A0BEAF8C5A}.Release|Win32.Build.0 = Release|Win32
+ {66E3CE14-884D-4AEA-9F20-15A0BEAF8C5A}.Release|x64.ActiveCfg = Release|x64
+ {66E3CE14-884D-4AEA-9F20-15A0BEAF8C5A}.Release|x64.Build.0 = Release|x64
+ {128E8BD0-174A-48F0-8771-92B1E8D18713}.Debug|Win32.ActiveCfg = Debug|Win32
+ {128E8BD0-174A-48F0-8771-92B1E8D18713}.Debug|Win32.Build.0 = Debug|Win32
+ {128E8BD0-174A-48F0-8771-92B1E8D18713}.Debug|x64.ActiveCfg = Debug|x64
+ {128E8BD0-174A-48F0-8771-92B1E8D18713}.Debug|x64.Build.0 = Debug|x64
+ {128E8BD0-174A-48F0-8771-92B1E8D18713}.Release|Win32.ActiveCfg = Release|Win32
+ {128E8BD0-174A-48F0-8771-92B1E8D18713}.Release|Win32.Build.0 = Release|Win32
+ {128E8BD0-174A-48F0-8771-92B1E8D18713}.Release|x64.ActiveCfg = Release|x64
+ {128E8BD0-174A-48F0-8771-92B1E8D18713}.Release|x64.Build.0 = Release|x64
+ EndGlobalSection
+ GlobalSection(SolutionProperties) = preSolution
+ HideSolutionNode = FALSE
+ EndGlobalSection
+EndGlobal
diff --git a/macosx.cmd b/macosx.cmd
new file mode 100644
index 0000000..46a0709
--- /dev/null
+++ b/macosx.cmd
@@ -0,0 +1 @@
+make DEBUG=DEBUG PLAT=macosx LUAINC_macosx_base=/Users/diego/build/macosx/include LUAPREFIX_macosx=/Users/diego/build/macosx install-both
diff --git a/makefile b/makefile
new file mode 100644
index 0000000..04cd894
--- /dev/null
+++ b/makefile
@@ -0,0 +1,43 @@
+# luasocket makefile
+#
+# see src/makefile for description of how to customize the build
+#
+# Targets:
+# install install system independent support
+# install-unix also install unix-only support
+# install-both install for both lua5.1 and lua5.2
+# install-both-unix also install unix-only
+# print print the build settings
+
+PLAT?= linux
+PLATS= macosx linux win32 mingw
+
+all: $(PLAT)
+
+$(PLATS) none install install-unix local clean:
+ $(MAKE) -C src $@
+
+print:
+ $(MAKE) -C src $@
+
+test:
+ lua test/hello.lua
+
+install-both:
+ $(MAKE) clean
+ @cd src; $(MAKE) $(PLAT) LUAV=5.1
+ @cd src; $(MAKE) install LUAV=5.1
+ $(MAKE) clean
+ @cd src; $(MAKE) $(PLAT) LUAV=5.2
+ @cd src; $(MAKE) install LUAV=5.2
+
+install-both-unix:
+ $(MAKE) clean
+ @cd src; $(MAKE) $(PLAT) LUAV=5.1
+ @cd src; $(MAKE) install-unix LUAV=5.1
+ $(MAKE) clean
+ @cd src; $(MAKE) $(PLAT) LUAV=5.2
+ @cd src; $(MAKE) install-unix LUAV=5.2
+
+.PHONY: test
+
diff --git a/makefile.dist b/makefile.dist
new file mode 100644
index 0000000..2c6137b
--- /dev/null
+++ b/makefile.dist
@@ -0,0 +1,133 @@
+#--------------------------------------------------------------------------
+# Distribution makefile
+#--------------------------------------------------------------------------
+DIST = luasocket-2.1-rc1
+
+TEST = \
+ test/README \
+ test/hello.lua \
+ test/testclnt.lua \
+ test/testsrvr.lua \
+ test/testsupport.lua
+
+SAMPLES = \
+ samples/README \
+ samples/cddb.lua \
+ samples/daytimeclnt.lua \
+ samples/echoclnt.lua \
+ samples/echosrvr.lua \
+ samples/mclisten.lua \
+ samples/mcsend.lua \
+ samples/listener.lua \
+ samples/lpr.lua \
+ samples/talker.lua \
+ samples/tinyirc.lua
+
+ETC = \
+ etc/README \
+ etc/b64.lua \
+ etc/check-links.lua \
+ etc/check-memory.lua \
+ etc/dict.lua \
+ etc/dispatch.lua \
+ etc/eol.lua \
+ etc/forward.lua \
+ etc/get.lua \
+ etc/lp.lua \
+ etc/qp.lua \
+ etc/tftp.lua
+
+SRC = \
+ src/makefile \
+ src/auxiliar.c \
+ src/auxiliar.h \
+ src/buffer.c \
+ src/buffer.h \
+ src/except.c \
+ src/except.h \
+ src/inet.c \
+ src/inet.h \
+ src/io.c \
+ src/io.h \
+ src/luasocket.c \
+ src/luasocket.h \
+ src/mime.c \
+ src/mime.h \
+ src/options.c \
+ src/options.h \
+ src/select.c \
+ src/select.h \
+ src/socket.h \
+ src/tcp.c \
+ src/tcp.h \
+ src/timeout.c \
+ src/timeout.h \
+ src/udp.c \
+ src/udp.h \
+ src/unix.c \
+ src/unix.h \
+ src/usocket.c \
+ src/usocket.h \
+ src/wsocket.c \
+ src/wsocket.h \
+ src/ftp.lua \
+ src/http.lua \
+ src/ltn12.lua \
+ src/mime.lua \
+ src/smtp.lua \
+ src/socket.lua \
+ src/headers.lua \
+ src/tp.lua \
+ src/url.lua
+
+MAKE = \
+ makefile \
+ luasocket.sln \
+ socket.vcproj \
+ mime.vcproj
+
+DOC = \
+ doc/dns.html \
+ doc/ftp.html \
+ doc/index.html \
+ doc/http.html \
+ doc/installation.html \
+ doc/introduction.html \
+ doc/ltn12.html \
+ doc/luasocket.png \
+ doc/mime.html \
+ doc/reference.css \
+ doc/reference.html \
+ doc/smtp.html \
+ doc/socket.html \
+ doc/tcp.html \
+ doc/udp.html \
+ doc/url.html
+
+dist:
+ mkdir -p $(DIST)
+ cp -vf NEW $(DIST)
+ cp -vf LICENSE $(DIST)
+ cp -vf README $(DIST)
+ cp -vf $(MAKE) $(DIST)
+
+ mkdir -p $(DIST)/etc
+ cp -vf $(ETC) $(DIST)/etc
+
+ mkdir -p $(DIST)/src
+ cp -vf $(SRC) $(DIST)/src
+
+ mkdir -p $(DIST)/doc
+ cp -vf $(DOC) $(DIST)/doc
+
+ mkdir -p $(DIST)/samples
+ cp -vf $(SAMPLES) $(DIST)/samples
+
+ mkdir -p $(DIST)/test
+ cp -vf $(TEST) $(DIST)/test
+
+ tar -zcvf $(DIST).tar.gz $(DIST)
+ zip -r $(DIST).zip $(DIST)
+
+clean:
+ \rm -rf $(DIST) $(DIST).tar.gz $(DIST).zip
diff --git a/mime.vcxproj b/mime.vcxproj
new file mode 100755
index 0000000..c77d611
--- /dev/null
+++ b/mime.vcxproj
@@ -0,0 +1,217 @@
+
+
+
+
+ Debug
+ Win32
+
+
+ Debug
+ x64
+
+
+ Release
+ Win32
+
+
+ Release
+ x64
+
+
+
+
+
+
+
+ Document
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)
+ $(LUABIN_PATH)$(Configuration)\%(Filename)%(Extension)
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)
+ $(LUABIN_PATH)$(Configuration)\%(Filename)%(Extension)
+ copy %(FullPath) $(LUALIB_PATH)$(Platform)\$(Configuration)
+ copy %(FullPath) $(LUALIB_PATH)$(Platform)\$(Configuration)
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\%(Filename)%(Extension)
+
+
+
+ {128E8BD0-174A-48F0-8771-92B1E8D18713}
+ Win32Proj
+
+
+
+ DynamicLibrary
+ v110
+ MultiByte
+
+
+ DynamicLibrary
+ v110
+ MultiByte
+
+
+ DynamicLibrary
+ v110
+ MultiByte
+
+
+ DynamicLibrary
+ v110
+ MultiByte
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ <_ProjectFileVersion>11.0.50727.1
+
+
+ $(LUABIN_PATH)$(Configuration)\mime\
+ $(Configuration)\
+ true
+ core
+
+
+ true
+ core
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\mime\
+
+
+ $(LUABIN_PATH)$(Configuration)\mime\
+ $(Configuration)\
+ false
+ core
+
+
+ false
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\mime\
+ core
+
+
+
+ Disabled
+ $(LUAINC_PATH);%(AdditionalIncludeDirectories)
+ WIN32;_DEBUG;_WINDOWS;_USRDLL;MIME_API=__declspec(dllexport);_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)
+ true
+ EnableFastChecks
+ MultiThreadedDebugDLL
+
+ Level3
+ EditAndContinue
+ $(IntDir)$(TargetName)$(PlatformToolsetVersion).pdb
+
+
+ $(LUALIB);%(AdditionalDependencies)
+ $(OutDir)$(TargetName).dll
+ $(LUALIB_PATH)$(Configuration);%(AdditionalLibraryDirectories)
+ true
+ $(OutDir)mime.pdb
+ Windows
+ false
+
+ $(OutDir)$(TargetName).lib
+ MachineX86
+ false
+
+
+
+
+ Disabled
+ $(LUAINC_PATH);%(AdditionalIncludeDirectories)
+ WIN32;_DEBUG;_WINDOWS;_USRDLL;MIME_API=__declspec(dllexport);_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)
+ EnableFastChecks
+ MultiThreadedDebugDLL
+
+
+ Level3
+ ProgramDatabase
+ $(IntDir)$(TargetName)$(PlatformToolsetVersion).pdb
+
+
+ $(LUALIB);%(AdditionalDependencies)
+ $(OutDir)$(TargetName).dll
+ $(LUALIB_PATH)$(Platform)\$(Configuration);%(AdditionalLibraryDirectories)
+ true
+ $(OutDir)mime.pdb
+ Windows
+ false
+
+
+ $(OutDir)$(TargetName).lib
+
+
+
+
+ $(LUAINC_PATH);%(AdditionalIncludeDirectories)
+ WIN32;NDEBUG;_WINDOWS;_USRDLL;MIME_API=__declspec(dllexport);_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)
+ MultiThreadedDLL
+
+ Level4
+
+ $(IntDir)$(TargetName)$(PlatformToolsetVersion).pdb
+
+
+ $(LUALIB);%(AdditionalDependencies)
+ $(OutDir)$(TargetName).dll
+ $(LUALIB_PATH)$(Configuration);%(AdditionalLibraryDirectories)
+ true
+ Windows
+ true
+ true
+ false
+
+ $(OutDir)$(TargetName).lib
+ MachineX86
+
+
+
+
+ $(LUAINC_PATH);%(AdditionalIncludeDirectories)
+ WIN32;NDEBUG;_WINDOWS;_USRDLL;MIME_API=__declspec(dllexport);_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)
+ MultiThreadedDLL
+
+
+ Level4
+
+
+ $(IntDir)$(TargetName)$(PlatformToolsetVersion).pdb
+
+
+ $(LUALIB);%(AdditionalDependencies)
+ $(OutDir)$(TargetName).dll
+ $(LUALIB_PATH)$(Platform)\$(Configuration);%(AdditionalLibraryDirectories)
+ true
+ Windows
+ true
+ true
+ false
+
+
+ $(OutDir)$(TargetName).lib
+
+
+
+
+
+
\ No newline at end of file
diff --git a/mime.vcxproj.filters b/mime.vcxproj.filters
new file mode 100644
index 0000000..621215b
--- /dev/null
+++ b/mime.vcxproj.filters
@@ -0,0 +1,16 @@
+
+
+
+
+
+
+
+ {fad87a86-297c-4881-a114-73b967bb3c92}
+
+
+
+
+ cdir
+
+
+
\ No newline at end of file
diff --git a/mingw.cmd b/mingw.cmd
new file mode 100644
index 0000000..bf2b7ed
--- /dev/null
+++ b/mingw.cmd
@@ -0,0 +1 @@
+make PLAT=mingw LUAINC_mingw_base=/home/diego/build/mingw/include LUALIB_mingw_base=/home/diego/build/mingw/bin LUAPREFIX_mingw=/home/diego/build/mingw/bin DEBUG=DEBUG install-both
diff --git a/samples/README b/samples/README
new file mode 100644
index 0000000..e63a6f5
--- /dev/null
+++ b/samples/README
@@ -0,0 +1,50 @@
+This directory contains some sample programs using
+LuaSocket. This code is not supported.
+
+ listener.lua -- socket to stdout
+ talker.lua -- stdin to socket
+
+listener.lua and talker.lua are about the simplest
+applications you can write using LuaSocket. Run
+
+ 'lua listener.lua' and 'lua talker.lua'
+
+on different terminals. Whatever you type on talk.lua will
+be printed by listen.lua.
+
+ lpr.lua -- lpr client
+
+This is a cool program written by David Burgess to print
+files using the Line Printer Daemon protocol, widely used in
+Unix machines. It uses the lp.lua implementation, in the
+etc directory. Just run 'lua lpr.lua
+queue=' and the file will print!
+
+ cddb.lua -- CDDB client
+
+This is the first try on a simple CDDB client. Not really
+useful, but one day it might become a module.
+
+ daytimeclnt.lua -- day time client
+
+Just run the program to retrieve the hour and date in
+readable form from any server running an UDP daytime daemon.
+
+ echoclnt.lua -- UDP echo client
+ echosrvr.lua -- UDP echo server
+
+These are a UDP echo client/server pair. They work with
+other client and servers as well.
+
+ tinyirc.lua -- irc like broadcast server
+
+This is a simple server that waits simultaneously on two
+server sockets for telnet connections. Everything it
+receives from the telnet clients is broadcasted to every
+other connected client. It tests the select function and
+shows how to create a simple server whith LuaSocket. Just
+run tinyirc.lua and then open as many telnet connections
+as you want to ports 8080 and 8081.
+
+Good luck,
+Diego.
diff --git a/samples/cddb.lua b/samples/cddb.lua
new file mode 100644
index 0000000..49a1871
--- /dev/null
+++ b/samples/cddb.lua
@@ -0,0 +1,46 @@
+local socket = require("socket")
+local http = require("socket.http")
+
+if not arg or not arg[1] or not arg[2] then
+ print("luasocket cddb.lua []")
+ os.exit(1)
+end
+
+local server = arg[3] or "http://freedb.freedb.org/~cddb/cddb.cgi"
+
+function parse(body)
+ local lines = string.gfind(body, "(.-)\r\n")
+ local status = lines()
+ local code, message = socket.skip(2, string.find(status, "(%d%d%d) (.*)"))
+ if tonumber(code) ~= 210 then
+ return nil, code, message
+ end
+ local data = {}
+ for l in lines do
+ local c = string.sub(l, 1, 1)
+ if c ~= '#' and c ~= '.' then
+ local key, value = socket.skip(2, string.find(l, "(.-)=(.*)"))
+ value = string.gsub(value, "\\n", "\n")
+ value = string.gsub(value, "\\\\", "\\")
+ value = string.gsub(value, "\\t", "\t")
+ data[key] = value
+ end
+ end
+ return data, code, message
+end
+
+local host = socket.dns.gethostname()
+local query = "%s?cmd=cddb+read+%s+%s&hello=LuaSocket+%s+LuaSocket+2.0&proto=6"
+local url = string.format(query, server, arg[1], arg[2], host)
+local body, headers, code = http.request(url)
+
+if code == 200 then
+ local data, code, error = parse(body)
+ if not data then
+ print(error or code)
+ else
+ for i,v in pairs(data) do
+ io.write(i, ': ', v, '\n')
+ end
+ end
+else print(error) end
diff --git a/samples/daytimeclnt.lua b/samples/daytimeclnt.lua
new file mode 100644
index 0000000..f81e37c
--- /dev/null
+++ b/samples/daytimeclnt.lua
@@ -0,0 +1,22 @@
+-----------------------------------------------------------------------------
+-- UDP sample: daytime protocol client
+-- LuaSocket sample files
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+local socket = require"socket"
+host = host or "127.0.0.1"
+port = port or 13
+if arg then
+ host = arg[1] or host
+ port = arg[2] or port
+end
+host = socket.dns.toip(host)
+udp = socket.udp()
+print("Using host '" ..host.. "' and port " ..port.. "...")
+udp:setpeername(host, port)
+udp:settimeout(3)
+sent, err = udp:send("anything")
+if err then print(err) os.exit() end
+dgram, err = udp:receive()
+if not dgram then print(err) os.exit() end
+io.write(dgram)
diff --git a/samples/echoclnt.lua b/samples/echoclnt.lua
new file mode 100644
index 0000000..bb22557
--- /dev/null
+++ b/samples/echoclnt.lua
@@ -0,0 +1,23 @@
+-----------------------------------------------------------------------------
+-- UDP sample: echo protocol client
+-- LuaSocket sample files
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+local socket = require("socket")
+host = host or "localhost"
+port = port or 7
+if arg then
+ host = arg[1] or host
+ port = arg[2] or port
+end
+host = socket.dns.toip(host)
+udp = assert(socket.udp())
+assert(udp:setpeername(host, port))
+print("Using remote host '" ..host.. "' and port " .. port .. "...")
+while 1 do
+ line = io.read()
+ if not line or line == "" then os.exit() end
+ assert(udp:send(line))
+ dgram = assert(udp:receive())
+ print(dgram)
+end
diff --git a/samples/echosrvr.lua b/samples/echosrvr.lua
new file mode 100644
index 0000000..ea564e2
--- /dev/null
+++ b/samples/echosrvr.lua
@@ -0,0 +1,28 @@
+-----------------------------------------------------------------------------
+-- UDP sample: echo protocol server
+-- LuaSocket sample files
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+local socket = require("socket")
+host = host or "127.0.0.1"
+port = port or 7
+if arg then
+ host = arg[1] or host
+ port = arg[2] or port
+end
+print("Binding to host '" ..host.. "' and port " ..port.. "...")
+udp = assert(socket.udp())
+assert(udp:setsockname(host, port))
+assert(udp:settimeout(5))
+ip, port = udp:getsockname()
+assert(ip, port)
+print("Waiting packets on " .. ip .. ":" .. port .. "...")
+while 1 do
+ dgram, ip, port = udp:receivefrom()
+ if dgram then
+ print("Echoing '" .. dgram .. "' to " .. ip .. ":" .. port)
+ udp:sendto(dgram, ip, port)
+ else
+ print(ip)
+ end
+end
diff --git a/samples/listener.lua b/samples/listener.lua
new file mode 100644
index 0000000..77db2d5
--- /dev/null
+++ b/samples/listener.lua
@@ -0,0 +1,25 @@
+-----------------------------------------------------------------------------
+-- TCP sample: Little program to dump lines received at a given port
+-- LuaSocket sample files
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+local socket = require("socket")
+host = host or "*"
+port = port or 8080
+if arg then
+ host = arg[1] or host
+ port = arg[2] or port
+end
+print("Binding to host '" ..host.. "' and port " ..port.. "...")
+s = assert(socket.bind(host, port))
+i, p = s:getsockname()
+assert(i, p)
+print("Waiting connection from talker on " .. i .. ":" .. p .. "...")
+c = assert(s:accept())
+print("Connected. Here is the stuff:")
+l, e = c:receive()
+while not e do
+ print(l)
+ l, e = c:receive()
+end
+print(e)
diff --git a/samples/lpr.lua b/samples/lpr.lua
new file mode 100644
index 0000000..49a1dfa
--- /dev/null
+++ b/samples/lpr.lua
@@ -0,0 +1,51 @@
+local lp = require("socket.lp")
+
+local function usage()
+ print('\nUsage: lua lpr.lua [filename] [keyword=val...]\n')
+ print('Valid keywords are :')
+ print(
+ ' host=remote host or IP address (default "localhost")\n' ..
+ ' queue=remote queue or printer name (default "printer")\n' ..
+ ' port=remote port number (default 515)\n' ..
+ ' user=sending user name\n' ..
+ ' format=["binary" | "text" | "ps" | "pr" | "fortran"] (default "binary")\n' ..
+ ' banner=true|false\n' ..
+ ' indent=number of columns to indent\n' ..
+ ' mail=email of address to notify when print is complete\n' ..
+ ' title=title to use for "pr" format\n' ..
+ ' width=width for "text" or "pr" formats\n' ..
+ ' class=\n' ..
+ ' job=\n' ..
+ ' name=\n' ..
+ ' localbind=true|false\n'
+ )
+ return nil
+end
+
+if not arg or not arg[1] then
+ return usage()
+end
+
+do
+ local opt = {}
+ local pat = "[%s%c%p]*([%w]*)=([\"]?[%w%s_!@#$%%^&*()<>:;]+[\"]?.?)"
+ for i = 2, #arg, 1 do
+ string.gsub(arg[i], pat, function(name, value) opt[name] = value end)
+ end
+ if not arg[2] then
+ return usage()
+ end
+ if arg[1] ~= "query" then
+ opt.file = arg[1]
+ r,e=lp.send(opt)
+ io.stdout:write(tostring(r or e),'\n')
+ else
+ r,e=lp.query(opt)
+ io.stdout:write(tostring(r or e), '\n')
+ end
+end
+
+-- trivial tests
+--lua lp.lua lp.lua queue=default host=localhost
+--lua lp.lua lp.lua queue=default host=localhost format=binary localbind=1
+--lua lp.lua query queue=default host=localhost
diff --git a/samples/mclisten.lua b/samples/mclisten.lua
new file mode 100644
index 0000000..d40d789
--- /dev/null
+++ b/samples/mclisten.lua
@@ -0,0 +1,18 @@
+local socket = require"socket"
+local group = "225.0.0.37"
+local port = 12345
+local c = assert(socket.udp())
+print(assert(c:setoption("reuseport", true)))
+print(assert(c:setsockname("*", port)))
+--print("loop:", c:getoption("ip-multicast-loop"))
+--print(assert(c:setoption("ip-multicast-loop", false)))
+--print("loop:", c:getoption("ip-multicast-loop"))
+--print("if:", c:getoption("ip-multicast-if"))
+--print(assert(c:setoption("ip-multicast-if", "127.0.0.1")))
+--print("if:", c:getoption("ip-multicast-if"))
+--print(assert(c:setoption("ip-multicast-if", "10.0.1.4")))
+--print("if:", c:getoption("ip-multicast-if"))
+print(assert(c:setoption("ip-add-membership", {multiaddr = group, interface = "*"})))
+while 1 do
+ print(c:receivefrom())
+end
diff --git a/samples/mcsend.lua b/samples/mcsend.lua
new file mode 100644
index 0000000..7c24cdf
--- /dev/null
+++ b/samples/mcsend.lua
@@ -0,0 +1,20 @@
+local socket = require"socket"
+local group = "225.0.0.37"
+local port = 12345
+local c = assert(socket.udp())
+--print(assert(c:setoption("reuseport", true)))
+--print(assert(c:setsockname("*", port)))
+--print(assert(c:setoption("ip-multicast-loop", false)))
+--print(assert(c:setoption("ip-multicast-ttl", 4)))
+--print(assert(c:setoption("ip-multicast-if", "10.0.1.3")))
+--print(assert(c:setoption("ip-add-membership", {multiaddr = group, interface = "*"})))
+local i = 0
+while 1 do
+ local message = string.format("hello all %d!", i)
+ assert(c:sendto(message, group, port))
+ print("sent " .. message)
+ socket.sleep(1)
+ c:settimeout(0.5)
+ print(c:receivefrom())
+ i = i + 1
+end
diff --git a/samples/talker.lua b/samples/talker.lua
new file mode 100644
index 0000000..d5a36cb
--- /dev/null
+++ b/samples/talker.lua
@@ -0,0 +1,20 @@
+-----------------------------------------------------------------------------
+-- TCP sample: Little program to send text lines to a given host/port
+-- LuaSocket sample files
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+local socket = require("socket")
+host = host or "localhost"
+port = port or 8080
+if arg then
+ host = arg[1] or host
+ port = arg[2] or port
+end
+print("Attempting connection to host '" ..host.. "' and port " ..port.. "...")
+c = assert(socket.connect(host, port))
+print("Connected! Please type stuff (empty line to stop):")
+l = io.read()
+while l and l ~= "" and not e do
+ assert(c:send(l .. "\n"))
+ l = io.read()
+end
diff --git a/samples/tinyirc.lua b/samples/tinyirc.lua
new file mode 100644
index 0000000..5babb7e
--- /dev/null
+++ b/samples/tinyirc.lua
@@ -0,0 +1,89 @@
+-----------------------------------------------------------------------------
+-- Select sample: simple text line server
+-- LuaSocket sample files.
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+local socket = require("socket")
+host = host or "*"
+port1 = port1 or 8080
+port2 = port2 or 8181
+if arg then
+ host = arg[1] or host
+ port1 = arg[2] or port1
+ port2 = arg[3] or port2
+end
+
+server1 = assert(socket.bind(host, port1))
+server2 = assert(socket.bind(host, port2))
+server1:settimeout(1) -- make sure we don't block in accept
+server2:settimeout(1)
+
+io.write("Servers bound\n")
+
+-- simple set implementation
+-- the select function doesn't care about what is passed to it as long as
+-- it behaves like a table
+-- creates a new set data structure
+function newset()
+ local reverse = {}
+ local set = {}
+ return setmetatable(set, {__index = {
+ insert = function(set, value)
+ if not reverse[value] then
+ table.insert(set, value)
+ reverse[value] = #set
+ end
+ end,
+ remove = function(set, value)
+ local index = reverse[value]
+ if index then
+ reverse[value] = nil
+ local top = table.remove(set)
+ if top ~= value then
+ reverse[top] = index
+ set[index] = top
+ end
+ end
+ end
+ }})
+end
+
+set = newset()
+
+io.write("Inserting servers in set\n")
+set:insert(server1)
+set:insert(server2)
+
+while 1 do
+ local readable, _, error = socket.select(set, nil)
+ for _, input in ipairs(readable) do
+ -- is it a server socket?
+ if input == server1 or input == server2 then
+ io.write("Waiting for clients\n")
+ local new = input:accept()
+ if new then
+ new:settimeout(1)
+ io.write("Inserting client in set\n")
+ set:insert(new)
+ end
+ -- it is a client socket
+ else
+ local line, error = input:receive()
+ if error then
+ input:close()
+ io.write("Removing client from set\n")
+ set:remove(input)
+ else
+ io.write("Broadcasting line '", line, "'\n")
+ writable, error = socket.skip(1, socket.select(nil, set, 1))
+ if not error then
+ for __, output in ipairs(writable) do
+ if output ~= input then
+ output:send(line .. "\n")
+ end
+ end
+ else io.write("No client ready to receive!!!\n") end
+ end
+ end
+ end
+end
diff --git a/socket.vcxproj b/socket.vcxproj
new file mode 100755
index 0000000..16daeef
--- /dev/null
+++ b/socket.vcxproj
@@ -0,0 +1,307 @@
+
+
+
+
+ Debug
+ Win32
+
+
+ Debug
+ x64
+
+
+ Release
+ Win32
+
+
+ Release
+ x64
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Document
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)
+ $(LUABIN_PATH)$(Configuration)\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Configuration)\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\%(Filename)%(Extension)
+
+
+ Document
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)
+ $(LUABIN_PATH)$(Configuration)\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Configuration)\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\%(Filename)%(Extension)
+
+
+
+
+ Document
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Configuration)\socket\%(Filename)%(Extension)
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)\socket
+
+
+ Document
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Configuration)\socket\%(Filename)%(Extension)
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)\socket
+
+
+ Document
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Configuration)\socket\%(Filename)%(Extension)
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)\socket
+
+
+ Document
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Configuration)\socket\%(Filename)%(Extension)
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)\socket
+
+
+ Document
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Configuration)\socket\%(Filename)%(Extension)
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)\socket
+
+
+ Document
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Configuration)\socket\%(Filename)%(Extension)
+ $(LUABIN_PATH)$(Configuration)\socket\%(Filename)%(Extension)
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Platform)\$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)\socket
+ copy %(FullPath) $(LUABIN_PATH)$(Configuration)\socket
+
+
+
+ {66E3CE14-884D-4AEA-9F20-15A0BEAF8C5A}
+ Win32Proj
+
+
+
+ DynamicLibrary
+ v110
+ MultiByte
+
+
+ DynamicLibrary
+ v110
+ MultiByte
+
+
+ DynamicLibrary
+ v110
+ MultiByte
+
+
+ DynamicLibrary
+ v110
+ MultiByte
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ <_ProjectFileVersion>11.0.50727.1
+
+
+ $(LUALIB_PATH)$(Configuration)\socket\
+ $(Configuration)\
+ true
+ core
+
+
+ true
+ core
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\socket\
+
+
+ $(LUALIB_PATH)$(Configuration)\socket\
+ $(Configuration)\
+ false
+ core
+
+
+ false
+ $(LUABIN_PATH)$(Platform)\$(Configuration)\socket\
+ core
+
+
+
+ Disabled
+ $(LUAINC_PATH);%(AdditionalIncludeDirectories)
+ WIN32;_DEBUG;_WINDOWS;_USRDLL;LUASOCKET_API=__declspec(dllexport);_CRT_SECURE_NO_WARNINGS;LUASOCKET_DEBUG;%(PreprocessorDefinitions)
+ true
+ EnableFastChecks
+ MultiThreadedDebugDLL
+
+ Level3
+ EditAndContinue
+ $(IntDir)$(TargetName)$(PlatformToolsetVersion).pdb
+
+
+ $(LUALIB);ws2_32.lib;%(AdditionalDependencies)
+ $(OutDir)$(TargetName).dll
+ $(LUALIB_PATH)$(Configuration);%(AdditionalLibraryDirectories)
+ true
+ $(OutDir)mime.pdb
+ Windows
+ false
+
+ $(OutDir)$(TargetName).lib
+ MachineX86
+ false
+
+
+
+
+ Disabled
+ $(LUAINC_PATH);%(AdditionalIncludeDirectories)
+ WIN32;_DEBUG;_WINDOWS;_USRDLL;LUASOCKET_API=__declspec(dllexport);_CRT_SECURE_NO_WARNINGS;LUASOCKET_DEBUG;%(PreprocessorDefinitions)
+ EnableFastChecks
+ MultiThreadedDebugDLL
+
+
+ Level3
+ ProgramDatabase
+ $(IntDir)$(TargetName)$(PlatformToolsetVersion).pdb
+
+
+ $(LUALIB);ws2_32.lib;%(AdditionalDependencies)
+ $(OutDir)$(TargetName).dll
+ $(LUALIB_PATH)$(Platform)\$(Configuration);%(AdditionalLibraryDirectories)
+ true
+ $(OutDir)mime.pdb
+ Windows
+ false
+
+
+ $(OutDir)$(TargetName).lib
+
+
+
+
+ $(LUAINC_PATH);%(AdditionalIncludeDirectories)
+ WIN32;NDEBUG;_WINDOWS;_USRDLL;LUASOCKET_API=__declspec(dllexport);_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)
+ MultiThreadedDLL
+
+ Level4
+
+ $(IntDir)$(TargetName)$(PlatformToolsetVersion).pdb
+
+
+ $(LUALIB);ws2_32.lib;%(AdditionalDependencies)
+ $(OutDir)$(TargetName).dll
+ $(LUALIB_PATH)$(Configuration);%(AdditionalLibraryDirectories)
+ true
+ Windows
+ true
+ true
+ false
+
+ $(OutDir)$(TargetName).lib
+ MachineX86
+
+
+
+
+ $(LUAINC_PATH);%(AdditionalIncludeDirectories)
+ WIN32;NDEBUG;_WINDOWS;_USRDLL;LUASOCKET_API=__declspec(dllexport);_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions)
+ MultiThreadedDLL
+
+
+ Level4
+
+
+ $(IntDir)$(TargetName)$(PlatformToolsetVersion).pdb
+
+
+ $(LUALIB);ws2_32.lib;%(AdditionalDependencies)
+ $(OutDir)$(TargetName).dll
+ $(LUALIB_PATH)$(Platform)\$(Configuration);%(AdditionalLibraryDirectories)
+ true
+ Windows
+ true
+ true
+ false
+
+
+ $(OutDir)$(TargetName).lib
+
+
+
+
+
+
\ No newline at end of file
diff --git a/socket.vcxproj.filters b/socket.vcxproj.filters
new file mode 100644
index 0000000..38f2f07
--- /dev/null
+++ b/socket.vcxproj.filters
@@ -0,0 +1,51 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ cdir
+
+
+ cdir
+
+
+ ldir
+
+
+ ldir
+
+
+ ldir
+
+
+ ldir
+
+
+ ldir
+
+
+ ldir
+
+
+
+
+ {b053460d-5439-4e3a-a2eb-c31a95b5691f}
+
+
+ {b301b82c-37cb-4e05-9333-194e92ed7a62}
+
+
+
\ No newline at end of file
diff --git a/src/auxiliar.c b/src/auxiliar.c
new file mode 100644
index 0000000..de625e9
--- /dev/null
+++ b/src/auxiliar.c
@@ -0,0 +1,158 @@
+/*=========================================================================*\
+* Auxiliar routines for class hierarchy manipulation
+* LuaSocket toolkit
+\*=========================================================================*/
+#include
+#include
+
+#include "auxiliar.h"
+
+/*=========================================================================*\
+* Exported functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Initializes the module
+\*-------------------------------------------------------------------------*/
+int auxiliar_open(lua_State *L) {
+ (void) L;
+ return 0;
+}
+
+/*-------------------------------------------------------------------------*\
+* Creates a new class with given methods
+* Methods whose names start with __ are passed directly to the metatable.
+\*-------------------------------------------------------------------------*/
+void auxiliar_newclass(lua_State *L, const char *classname, luaL_Reg *func) {
+ luaL_newmetatable(L, classname); /* mt */
+ /* create __index table to place methods */
+ lua_pushstring(L, "__index"); /* mt,"__index" */
+ lua_newtable(L); /* mt,"__index",it */
+ /* put class name into class metatable */
+ lua_pushstring(L, "class"); /* mt,"__index",it,"class" */
+ lua_pushstring(L, classname); /* mt,"__index",it,"class",classname */
+ lua_rawset(L, -3); /* mt,"__index",it */
+ /* pass all methods that start with _ to the metatable, and all others
+ * to the index table */
+ for (; func->name; func++) { /* mt,"__index",it */
+ lua_pushstring(L, func->name);
+ lua_pushcfunction(L, func->func);
+ lua_rawset(L, func->name[0] == '_' ? -5: -3);
+ }
+ lua_rawset(L, -3); /* mt */
+ lua_pop(L, 1);
+}
+
+/*-------------------------------------------------------------------------*\
+* Prints the value of a class in a nice way
+\*-------------------------------------------------------------------------*/
+int auxiliar_tostring(lua_State *L) {
+ char buf[32];
+ if (!lua_getmetatable(L, 1)) goto error;
+ lua_pushstring(L, "__index");
+ lua_gettable(L, -2);
+ if (!lua_istable(L, -1)) goto error;
+ lua_pushstring(L, "class");
+ lua_gettable(L, -2);
+ if (!lua_isstring(L, -1)) goto error;
+ sprintf(buf, "%p", lua_touserdata(L, 1));
+ lua_pushfstring(L, "%s: %s", lua_tostring(L, -1), buf);
+ return 1;
+error:
+ lua_pushstring(L, "invalid object passed to 'auxiliar.c:__tostring'");
+ lua_error(L);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Insert class into group
+\*-------------------------------------------------------------------------*/
+void auxiliar_add2group(lua_State *L, const char *classname, const char *groupname) {
+ luaL_getmetatable(L, classname);
+ lua_pushstring(L, groupname);
+ lua_pushboolean(L, 1);
+ lua_rawset(L, -3);
+ lua_pop(L, 1);
+}
+
+/*-------------------------------------------------------------------------*\
+* Make sure argument is a boolean
+\*-------------------------------------------------------------------------*/
+int auxiliar_checkboolean(lua_State *L, int objidx) {
+ if (!lua_isboolean(L, objidx))
+ auxiliar_typeerror(L, objidx, lua_typename(L, LUA_TBOOLEAN));
+ return lua_toboolean(L, objidx);
+}
+
+/*-------------------------------------------------------------------------*\
+* Return userdata pointer if object belongs to a given class, abort with
+* error otherwise
+\*-------------------------------------------------------------------------*/
+void *auxiliar_checkclass(lua_State *L, const char *classname, int objidx) {
+ void *data = auxiliar_getclassudata(L, classname, objidx);
+ if (!data) {
+ char msg[45];
+ sprintf(msg, "%.35s expected", classname);
+ luaL_argerror(L, objidx, msg);
+ }
+ return data;
+}
+
+/*-------------------------------------------------------------------------*\
+* Return userdata pointer if object belongs to a given group, abort with
+* error otherwise
+\*-------------------------------------------------------------------------*/
+void *auxiliar_checkgroup(lua_State *L, const char *groupname, int objidx) {
+ void *data = auxiliar_getgroupudata(L, groupname, objidx);
+ if (!data) {
+ char msg[45];
+ sprintf(msg, "%.35s expected", groupname);
+ luaL_argerror(L, objidx, msg);
+ }
+ return data;
+}
+
+/*-------------------------------------------------------------------------*\
+* Set object class
+\*-------------------------------------------------------------------------*/
+void auxiliar_setclass(lua_State *L, const char *classname, int objidx) {
+ luaL_getmetatable(L, classname);
+ if (objidx < 0) objidx--;
+ lua_setmetatable(L, objidx);
+}
+
+/*-------------------------------------------------------------------------*\
+* Get a userdata pointer if object belongs to a given group. Return NULL
+* otherwise
+\*-------------------------------------------------------------------------*/
+void *auxiliar_getgroupudata(lua_State *L, const char *groupname, int objidx) {
+ if (!lua_getmetatable(L, objidx))
+ return NULL;
+ lua_pushstring(L, groupname);
+ lua_rawget(L, -2);
+ if (lua_isnil(L, -1)) {
+ lua_pop(L, 2);
+ return NULL;
+ } else {
+ lua_pop(L, 2);
+ return lua_touserdata(L, objidx);
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Get a userdata pointer if object belongs to a given class. Return NULL
+* otherwise
+\*-------------------------------------------------------------------------*/
+void *auxiliar_getclassudata(lua_State *L, const char *classname, int objidx) {
+ return luaL_checkudata(L, objidx, classname);
+}
+
+/*-------------------------------------------------------------------------*\
+* Throws error when argument does not have correct type.
+* Used to be part of lauxlib in Lua 5.1, was dropped from 5.2.
+\*-------------------------------------------------------------------------*/
+int auxiliar_typeerror (lua_State *L, int narg, const char *tname) {
+ const char *msg = lua_pushfstring(L, "%s expected, got %s", tname,
+ luaL_typename(L, narg));
+ return luaL_argerror(L, narg, msg);
+}
+
diff --git a/src/auxiliar.h b/src/auxiliar.h
new file mode 100644
index 0000000..ea99013
--- /dev/null
+++ b/src/auxiliar.h
@@ -0,0 +1,47 @@
+#ifndef AUXILIAR_H
+#define AUXILIAR_H
+/*=========================================================================*\
+* Auxiliar routines for class hierarchy manipulation
+* LuaSocket toolkit (but completely independent of other LuaSocket modules)
+*
+* A LuaSocket class is a name associated with Lua metatables. A LuaSocket
+* group is a name associated with a class. A class can belong to any number
+* of groups. This module provides the functionality to:
+*
+* - create new classes
+* - add classes to groups
+* - set the class of objects
+* - check if an object belongs to a given class or group
+* - get the userdata associated to objects
+* - print objects in a pretty way
+*
+* LuaSocket class names follow the convention {}. Modules
+* can define any number of classes and groups. The module tcp.c, for
+* example, defines the classes tcp{master}, tcp{client} and tcp{server} and
+* the groups tcp{client,server} and tcp{any}. Module functions can then
+* perform type-checking on their arguments by either class or group.
+*
+* LuaSocket metatables define the __index metamethod as being a table. This
+* table has one field for each method supported by the class, and a field
+* "class" with the class name.
+*
+* The mapping from class name to the corresponding metatable and the
+* reverse mapping are done using lauxlib.
+\*=========================================================================*/
+
+#include "lua.h"
+#include "lauxlib.h"
+
+int auxiliar_open(lua_State *L);
+void auxiliar_newclass(lua_State *L, const char *classname, luaL_Reg *func);
+void auxiliar_add2group(lua_State *L, const char *classname, const char *group);
+void auxiliar_setclass(lua_State *L, const char *classname, int objidx);
+void *auxiliar_checkclass(lua_State *L, const char *classname, int objidx);
+void *auxiliar_checkgroup(lua_State *L, const char *groupname, int objidx);
+void *auxiliar_getclassudata(lua_State *L, const char *groupname, int objidx);
+void *auxiliar_getgroupudata(lua_State *L, const char *groupname, int objidx);
+int auxiliar_checkboolean(lua_State *L, int objidx);
+int auxiliar_tostring(lua_State *L);
+int auxiliar_typeerror(lua_State *L, int narg, const char *tname);
+
+#endif /* AUXILIAR_H */
diff --git a/src/buffer.c b/src/buffer.c
new file mode 100644
index 0000000..4ef4e8e
--- /dev/null
+++ b/src/buffer.c
@@ -0,0 +1,276 @@
+/*=========================================================================*\
+* Input/Output interface for Lua programs
+* LuaSocket toolkit
+\*=========================================================================*/
+#include "lua.h"
+#include "lauxlib.h"
+
+#include "buffer.h"
+
+/*=========================================================================*\
+* Internal function prototypes
+\*=========================================================================*/
+static int recvraw(p_buffer buf, size_t wanted, luaL_Buffer *b);
+static int recvline(p_buffer buf, luaL_Buffer *b);
+static int recvall(p_buffer buf, luaL_Buffer *b);
+static int buffer_get(p_buffer buf, const char **data, size_t *count);
+static void buffer_skip(p_buffer buf, size_t count);
+static int sendraw(p_buffer buf, const char *data, size_t count, size_t *sent);
+
+/* min and max macros */
+#ifndef MIN
+#define MIN(x, y) ((x) < (y) ? x : y)
+#endif
+#ifndef MAX
+#define MAX(x, y) ((x) > (y) ? x : y)
+#endif
+
+/*=========================================================================*\
+* Exported functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Initializes module
+\*-------------------------------------------------------------------------*/
+int buffer_open(lua_State *L) {
+ (void) L;
+ return 0;
+}
+
+/*-------------------------------------------------------------------------*\
+* Initializes C structure
+\*-------------------------------------------------------------------------*/
+void buffer_init(p_buffer buf, p_io io, p_timeout tm) {
+ buf->first = buf->last = 0;
+ buf->io = io;
+ buf->tm = tm;
+ buf->received = buf->sent = 0;
+ buf->birthday = timeout_gettime();
+}
+
+/*-------------------------------------------------------------------------*\
+* object:getstats() interface
+\*-------------------------------------------------------------------------*/
+int buffer_meth_getstats(lua_State *L, p_buffer buf) {
+ lua_pushnumber(L, (lua_Number) buf->received);
+ lua_pushnumber(L, (lua_Number) buf->sent);
+ lua_pushnumber(L, timeout_gettime() - buf->birthday);
+ return 3;
+}
+
+/*-------------------------------------------------------------------------*\
+* object:setstats() interface
+\*-------------------------------------------------------------------------*/
+int buffer_meth_setstats(lua_State *L, p_buffer buf) {
+ buf->received = (long) luaL_optnumber(L, 2, (lua_Number) buf->received);
+ buf->sent = (long) luaL_optnumber(L, 3, (lua_Number) buf->sent);
+ if (lua_isnumber(L, 4)) buf->birthday = timeout_gettime() - lua_tonumber(L, 4);
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* object:send() interface
+\*-------------------------------------------------------------------------*/
+int buffer_meth_send(lua_State *L, p_buffer buf) {
+ int top = lua_gettop(L);
+ int err = IO_DONE;
+ size_t size = 0, sent = 0;
+ const char *data = luaL_checklstring(L, 2, &size);
+ long start = (long) luaL_optnumber(L, 3, 1);
+ long end = (long) luaL_optnumber(L, 4, -1);
+#ifdef LUASOCKET_DEBUG
+ p_timeout tm = timeout_markstart(buf->tm);
+#endif
+ if (start < 0) start = (long) (size+start+1);
+ if (end < 0) end = (long) (size+end+1);
+ if (start < 1) start = (long) 1;
+ if (end > (long) size) end = (long) size;
+ if (start <= end) err = sendraw(buf, data+start-1, end-start+1, &sent);
+ /* check if there was an error */
+ if (err != IO_DONE) {
+ lua_pushnil(L);
+ lua_pushstring(L, buf->io->error(buf->io->ctx, err));
+ lua_pushnumber(L, (lua_Number) (sent+start-1));
+ } else {
+ lua_pushnumber(L, (lua_Number) (sent+start-1));
+ lua_pushnil(L);
+ lua_pushnil(L);
+ }
+#ifdef LUASOCKET_DEBUG
+ /* push time elapsed during operation as the last return value */
+ lua_pushnumber(L, timeout_gettime() - timeout_getstart(tm));
+#endif
+ return lua_gettop(L) - top;
+}
+
+/*-------------------------------------------------------------------------*\
+* object:receive() interface
+\*-------------------------------------------------------------------------*/
+int buffer_meth_receive(lua_State *L, p_buffer buf) {
+ int err = IO_DONE, top = lua_gettop(L);
+ luaL_Buffer b;
+ size_t size;
+ const char *part = luaL_optlstring(L, 3, "", &size);
+#ifdef LUASOCKET_DEBUG
+ p_timeout tm = timeout_markstart(buf->tm);
+#endif
+ /* initialize buffer with optional extra prefix
+ * (useful for concatenating previous partial results) */
+ luaL_buffinit(L, &b);
+ luaL_addlstring(&b, part, size);
+ /* receive new patterns */
+ if (!lua_isnumber(L, 2)) {
+ const char *p= luaL_optstring(L, 2, "*l");
+ if (p[0] == '*' && p[1] == 'l') err = recvline(buf, &b);
+ else if (p[0] == '*' && p[1] == 'a') err = recvall(buf, &b);
+ else luaL_argcheck(L, 0, 2, "invalid receive pattern");
+ /* get a fixed number of bytes (minus what was already partially
+ * received) */
+ } else {
+ double n = lua_tonumber(L, 2);
+ size_t wanted = (size_t) n;
+ luaL_argcheck(L, n >= 0, 2, "invalid receive pattern");
+ if (size == 0 || wanted > size)
+ err = recvraw(buf, wanted-size, &b);
+ }
+ /* check if there was an error */
+ if (err != IO_DONE) {
+ /* we can't push anyting in the stack before pushing the
+ * contents of the buffer. this is the reason for the complication */
+ luaL_pushresult(&b);
+ lua_pushstring(L, buf->io->error(buf->io->ctx, err));
+ lua_pushvalue(L, -2);
+ lua_pushnil(L);
+ lua_replace(L, -4);
+ } else {
+ luaL_pushresult(&b);
+ lua_pushnil(L);
+ lua_pushnil(L);
+ }
+#ifdef LUASOCKET_DEBUG
+ /* push time elapsed during operation as the last return value */
+ lua_pushnumber(L, timeout_gettime() - timeout_getstart(tm));
+#endif
+ return lua_gettop(L) - top;
+}
+
+/*-------------------------------------------------------------------------*\
+* Determines if there is any data in the read buffer
+\*-------------------------------------------------------------------------*/
+int buffer_isempty(p_buffer buf) {
+ return buf->first >= buf->last;
+}
+
+/*=========================================================================*\
+* Internal functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Sends a block of data (unbuffered)
+\*-------------------------------------------------------------------------*/
+#define STEPSIZE 8192
+static int sendraw(p_buffer buf, const char *data, size_t count, size_t *sent) {
+ p_io io = buf->io;
+ p_timeout tm = buf->tm;
+ size_t total = 0;
+ int err = IO_DONE;
+ while (total < count && err == IO_DONE) {
+ size_t done = 0;
+ size_t step = (count-total <= STEPSIZE)? count-total: STEPSIZE;
+ err = io->send(io->ctx, data+total, step, &done, tm);
+ total += done;
+ }
+ *sent = total;
+ buf->sent += total;
+ return err;
+}
+
+/*-------------------------------------------------------------------------*\
+* Reads a fixed number of bytes (buffered)
+\*-------------------------------------------------------------------------*/
+static int recvraw(p_buffer buf, size_t wanted, luaL_Buffer *b) {
+ int err = IO_DONE;
+ size_t total = 0;
+ while (err == IO_DONE) {
+ size_t count; const char *data;
+ err = buffer_get(buf, &data, &count);
+ count = MIN(count, wanted - total);
+ luaL_addlstring(b, data, count);
+ buffer_skip(buf, count);
+ total += count;
+ if (total >= wanted) break;
+ }
+ return err;
+}
+
+/*-------------------------------------------------------------------------*\
+* Reads everything until the connection is closed (buffered)
+\*-------------------------------------------------------------------------*/
+static int recvall(p_buffer buf, luaL_Buffer *b) {
+ int err = IO_DONE;
+ size_t total = 0;
+ while (err == IO_DONE) {
+ const char *data; size_t count;
+ err = buffer_get(buf, &data, &count);
+ total += count;
+ luaL_addlstring(b, data, count);
+ buffer_skip(buf, count);
+ }
+ if (err == IO_CLOSED) {
+ if (total > 0) return IO_DONE;
+ else return IO_CLOSED;
+ } else return err;
+}
+
+/*-------------------------------------------------------------------------*\
+* Reads a line terminated by a CR LF pair or just by a LF. The CR and LF
+* are not returned by the function and are discarded from the buffer
+\*-------------------------------------------------------------------------*/
+static int recvline(p_buffer buf, luaL_Buffer *b) {
+ int err = IO_DONE;
+ while (err == IO_DONE) {
+ size_t count, pos; const char *data;
+ err = buffer_get(buf, &data, &count);
+ pos = 0;
+ while (pos < count && data[pos] != '\n') {
+ /* we ignore all \r's */
+ if (data[pos] != '\r') luaL_addchar(b, data[pos]);
+ pos++;
+ }
+ if (pos < count) { /* found '\n' */
+ buffer_skip(buf, pos+1); /* skip '\n' too */
+ break; /* we are done */
+ } else /* reached the end of the buffer */
+ buffer_skip(buf, pos);
+ }
+ return err;
+}
+
+/*-------------------------------------------------------------------------*\
+* Skips a given number of bytes from read buffer. No data is read from the
+* transport layer
+\*-------------------------------------------------------------------------*/
+static void buffer_skip(p_buffer buf, size_t count) {
+ buf->received += count;
+ buf->first += count;
+ if (buffer_isempty(buf))
+ buf->first = buf->last = 0;
+}
+
+/*-------------------------------------------------------------------------*\
+* Return any data available in buffer, or get more data from transport layer
+* if buffer is empty
+\*-------------------------------------------------------------------------*/
+static int buffer_get(p_buffer buf, const char **data, size_t *count) {
+ int err = IO_DONE;
+ p_io io = buf->io;
+ p_timeout tm = buf->tm;
+ if (buffer_isempty(buf)) {
+ size_t got;
+ err = io->recv(io->ctx, buf->data, BUF_SIZE, &got, tm);
+ buf->first = 0;
+ buf->last = got;
+ }
+ *count = buf->last - buf->first;
+ *data = buf->data + buf->first;
+ return err;
+}
diff --git a/src/buffer.h b/src/buffer.h
new file mode 100644
index 0000000..1281bb3
--- /dev/null
+++ b/src/buffer.h
@@ -0,0 +1,45 @@
+#ifndef BUF_H
+#define BUF_H
+/*=========================================================================*\
+* Input/Output interface for Lua programs
+* LuaSocket toolkit
+*
+* Line patterns require buffering. Reading one character at a time involves
+* too many system calls and is very slow. This module implements the
+* LuaSocket interface for input/output on connected objects, as seen by
+* Lua programs.
+*
+* Input is buffered. Output is *not* buffered because there was no simple
+* way of making sure the buffered output data would ever be sent.
+*
+* The module is built on top of the I/O abstraction defined in io.h and the
+* timeout management is done with the timeout.h interface.
+\*=========================================================================*/
+#include "lua.h"
+
+#include "io.h"
+#include "timeout.h"
+
+/* buffer size in bytes */
+#define BUF_SIZE 8192
+
+/* buffer control structure */
+typedef struct t_buffer_ {
+ double birthday; /* throttle support info: creation time, */
+ size_t sent, received; /* bytes sent, and bytes received */
+ p_io io; /* IO driver used for this buffer */
+ p_timeout tm; /* timeout management for this buffer */
+ size_t first, last; /* index of first and last bytes of stored data */
+ char data[BUF_SIZE]; /* storage space for buffer data */
+} t_buffer;
+typedef t_buffer *p_buffer;
+
+int buffer_open(lua_State *L);
+void buffer_init(p_buffer buf, p_io io, p_timeout tm);
+int buffer_meth_send(lua_State *L, p_buffer buf);
+int buffer_meth_receive(lua_State *L, p_buffer buf);
+int buffer_meth_getstats(lua_State *L, p_buffer buf);
+int buffer_meth_setstats(lua_State *L, p_buffer buf);
+int buffer_isempty(p_buffer buf);
+
+#endif /* BUF_H */
diff --git a/src/except.c b/src/except.c
new file mode 100644
index 0000000..002e701
--- /dev/null
+++ b/src/except.c
@@ -0,0 +1,101 @@
+/*=========================================================================*\
+* Simple exception support
+* LuaSocket toolkit
+\*=========================================================================*/
+#include
+
+#include "lua.h"
+#include "lauxlib.h"
+
+#include "except.h"
+
+/*=========================================================================*\
+* Internal function prototypes.
+\*=========================================================================*/
+static int global_protect(lua_State *L);
+static int global_newtry(lua_State *L);
+static int protected_(lua_State *L);
+static int finalize(lua_State *L);
+static int do_nothing(lua_State *L);
+
+/* except functions */
+static luaL_Reg func[] = {
+ {"newtry", global_newtry},
+ {"protect", global_protect},
+ {NULL, NULL}
+};
+
+/*-------------------------------------------------------------------------*\
+* Try factory
+\*-------------------------------------------------------------------------*/
+static void wrap(lua_State *L) {
+ lua_newtable(L);
+ lua_pushnumber(L, 1);
+ lua_pushvalue(L, -3);
+ lua_settable(L, -3);
+ lua_insert(L, -2);
+ lua_pop(L, 1);
+}
+
+static int finalize(lua_State *L) {
+ if (!lua_toboolean(L, 1)) {
+ lua_pushvalue(L, lua_upvalueindex(1));
+ lua_pcall(L, 0, 0, 0);
+ lua_settop(L, 2);
+ wrap(L);
+ lua_error(L);
+ return 0;
+ } else return lua_gettop(L);
+}
+
+static int do_nothing(lua_State *L) {
+ (void) L;
+ return 0;
+}
+
+static int global_newtry(lua_State *L) {
+ lua_settop(L, 1);
+ if (lua_isnil(L, 1)) lua_pushcfunction(L, do_nothing);
+ lua_pushcclosure(L, finalize, 1);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Protect factory
+\*-------------------------------------------------------------------------*/
+static int unwrap(lua_State *L) {
+ if (lua_istable(L, -1)) {
+ lua_pushnumber(L, 1);
+ lua_gettable(L, -2);
+ lua_pushnil(L);
+ lua_insert(L, -2);
+ return 1;
+ } else return 0;
+}
+
+static int protected_(lua_State *L) {
+ lua_pushvalue(L, lua_upvalueindex(1));
+ lua_insert(L, 1);
+ if (lua_pcall(L, lua_gettop(L) - 1, LUA_MULTRET, 0) != 0) {
+ if (unwrap(L)) return 2;
+ else lua_error(L);
+ return 0;
+ } else return lua_gettop(L);
+}
+
+static int global_protect(lua_State *L) {
+ lua_pushcclosure(L, protected_, 1);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Init module
+\*-------------------------------------------------------------------------*/
+int except_open(lua_State *L) {
+#if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE)
+ luaL_setfuncs(L, func, 0);
+#else
+ luaL_openlib(L, NULL, func, 0);
+#endif
+ return 0;
+}
diff --git a/src/except.h b/src/except.h
new file mode 100644
index 0000000..1e7a245
--- /dev/null
+++ b/src/except.h
@@ -0,0 +1,33 @@
+#ifndef EXCEPT_H
+#define EXCEPT_H
+/*=========================================================================*\
+* Exception control
+* LuaSocket toolkit (but completely independent from other modules)
+*
+* This provides support for simple exceptions in Lua. During the
+* development of the HTTP/FTP/SMTP support, it became aparent that
+* error checking was taking a substantial amount of the coding. These
+* function greatly simplify the task of checking errors.
+*
+* The main idea is that functions should return nil as its first return
+* value when it finds an error, and return an error message (or value)
+* following nil. In case of success, as long as the first value is not nil,
+* the other values don't matter.
+*
+* The idea is to nest function calls with the "try" function. This function
+* checks the first value, and calls "error" on the second if the first is
+* nil. Otherwise, it returns all values it received.
+*
+* The protect function returns a new function that behaves exactly like the
+* function it receives, but the new function doesn't throw exceptions: it
+* returns nil followed by the error message instead.
+*
+* With these two function, it's easy to write functions that throw
+* exceptions on error, but that don't interrupt the user script.
+\*=========================================================================*/
+
+#include "lua.h"
+
+int except_open(lua_State *L);
+
+#endif
diff --git a/src/ftp.lua b/src/ftp.lua
new file mode 100644
index 0000000..ea1145b
--- /dev/null
+++ b/src/ftp.lua
@@ -0,0 +1,285 @@
+-----------------------------------------------------------------------------
+-- FTP support for the Lua language
+-- LuaSocket toolkit.
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+
+-----------------------------------------------------------------------------
+-- Declare module and import dependencies
+-----------------------------------------------------------------------------
+local base = _G
+local table = require("table")
+local string = require("string")
+local math = require("math")
+local socket = require("socket")
+local url = require("socket.url")
+local tp = require("socket.tp")
+local ltn12 = require("ltn12")
+socket.ftp = {}
+local _M = socket.ftp
+-----------------------------------------------------------------------------
+-- Program constants
+-----------------------------------------------------------------------------
+-- timeout in seconds before the program gives up on a connection
+_M.TIMEOUT = 60
+-- default port for ftp service
+_M.PORT = 21
+-- this is the default anonymous password. used when no password is
+-- provided in url. should be changed to your e-mail.
+_M.USER = "ftp"
+_M.PASSWORD = "anonymous@anonymous.org"
+
+-----------------------------------------------------------------------------
+-- Low level FTP API
+-----------------------------------------------------------------------------
+local metat = { __index = {} }
+
+function _M.open(server, port, create)
+ local tp = socket.try(tp.connect(server, port or _M.PORT, _M.TIMEOUT, create))
+ local f = base.setmetatable({ tp = tp }, metat)
+ -- make sure everything gets closed in an exception
+ f.try = socket.newtry(function() f:close() end)
+ return f
+end
+
+function metat.__index:portconnect()
+ self.try(self.server:settimeout(_M.TIMEOUT))
+ self.data = self.try(self.server:accept())
+ self.try(self.data:settimeout(_M.TIMEOUT))
+end
+
+function metat.__index:pasvconnect()
+ self.data = self.try(socket.tcp())
+ self.try(self.data:settimeout(_M.TIMEOUT))
+ self.try(self.data:connect(self.pasvt.ip, self.pasvt.port))
+end
+
+function metat.__index:login(user, password)
+ self.try(self.tp:command("user", user or _M.USER))
+ local code, reply = self.try(self.tp:check{"2..", 331})
+ if code == 331 then
+ self.try(self.tp:command("pass", password or _M.PASSWORD))
+ self.try(self.tp:check("2.."))
+ end
+ return 1
+end
+
+function metat.__index:pasv()
+ self.try(self.tp:command("pasv"))
+ local code, reply = self.try(self.tp:check("2.."))
+ local pattern = "(%d+)%D(%d+)%D(%d+)%D(%d+)%D(%d+)%D(%d+)"
+ local a, b, c, d, p1, p2 = socket.skip(2, string.find(reply, pattern))
+ self.try(a and b and c and d and p1 and p2, reply)
+ self.pasvt = {
+ ip = string.format("%d.%d.%d.%d", a, b, c, d),
+ port = p1*256 + p2
+ }
+ if self.server then
+ self.server:close()
+ self.server = nil
+ end
+ return self.pasvt.ip, self.pasvt.port
+end
+
+function metat.__index:port(ip, port)
+ self.pasvt = nil
+ if not ip then
+ ip, port = self.try(self.tp:getcontrol():getsockname())
+ self.server = self.try(socket.bind(ip, 0))
+ ip, port = self.try(self.server:getsockname())
+ self.try(self.server:settimeout(_M.TIMEOUT))
+ end
+ local pl = math.mod(port, 256)
+ local ph = (port - pl)/256
+ local arg = string.gsub(string.format("%s,%d,%d", ip, ph, pl), "%.", ",")
+ self.try(self.tp:command("port", arg))
+ self.try(self.tp:check("2.."))
+ return 1
+end
+
+function metat.__index:send(sendt)
+ self.try(self.pasvt or self.server, "need port or pasv first")
+ -- if there is a pasvt table, we already sent a PASV command
+ -- we just get the data connection into self.data
+ if self.pasvt then self:pasvconnect() end
+ -- get the transfer argument and command
+ local argument = sendt.argument or
+ url.unescape(string.gsub(sendt.path or "", "^[/\\]", ""))
+ if argument == "" then argument = nil end
+ local command = sendt.command or "stor"
+ -- send the transfer command and check the reply
+ self.try(self.tp:command(command, argument))
+ local code, reply = self.try(self.tp:check{"2..", "1.."})
+ -- if there is not a a pasvt table, then there is a server
+ -- and we already sent a PORT command
+ if not self.pasvt then self:portconnect() end
+ -- get the sink, source and step for the transfer
+ local step = sendt.step or ltn12.pump.step
+ local readt = {self.tp.c}
+ local checkstep = function(src, snk)
+ -- check status in control connection while downloading
+ local readyt = socket.select(readt, nil, 0)
+ if readyt[tp] then code = self.try(self.tp:check("2..")) end
+ return step(src, snk)
+ end
+ local sink = socket.sink("close-when-done", self.data)
+ -- transfer all data and check error
+ self.try(ltn12.pump.all(sendt.source, sink, checkstep))
+ if string.find(code, "1..") then self.try(self.tp:check("2..")) end
+ -- done with data connection
+ self.data:close()
+ -- find out how many bytes were sent
+ local sent = socket.skip(1, self.data:getstats())
+ self.data = nil
+ return sent
+end
+
+function metat.__index:receive(recvt)
+ self.try(self.pasvt or self.server, "need port or pasv first")
+ if self.pasvt then self:pasvconnect() end
+ local argument = recvt.argument or
+ url.unescape(string.gsub(recvt.path or "", "^[/\\]", ""))
+ if argument == "" then argument = nil end
+ local command = recvt.command or "retr"
+ self.try(self.tp:command(command, argument))
+ local code,reply = self.try(self.tp:check{"1..", "2.."})
+ if (code >= 200) and (code <= 299) then
+ recvt.sink(reply)
+ return 1
+ end
+ if not self.pasvt then self:portconnect() end
+ local source = socket.source("until-closed", self.data)
+ local step = recvt.step or ltn12.pump.step
+ self.try(ltn12.pump.all(source, recvt.sink, step))
+ if string.find(code, "1..") then self.try(self.tp:check("2..")) end
+ self.data:close()
+ self.data = nil
+ return 1
+end
+
+function metat.__index:cwd(dir)
+ self.try(self.tp:command("cwd", dir))
+ self.try(self.tp:check(250))
+ return 1
+end
+
+function metat.__index:type(type)
+ self.try(self.tp:command("type", type))
+ self.try(self.tp:check(200))
+ return 1
+end
+
+function metat.__index:greet()
+ local code = self.try(self.tp:check{"1..", "2.."})
+ if string.find(code, "1..") then self.try(self.tp:check("2..")) end
+ return 1
+end
+
+function metat.__index:quit()
+ self.try(self.tp:command("quit"))
+ self.try(self.tp:check("2.."))
+ return 1
+end
+
+function metat.__index:close()
+ if self.data then self.data:close() end
+ if self.server then self.server:close() end
+ return self.tp:close()
+end
+
+-----------------------------------------------------------------------------
+-- High level FTP API
+-----------------------------------------------------------------------------
+local function override(t)
+ if t.url then
+ local u = url.parse(t.url)
+ for i,v in base.pairs(t) do
+ u[i] = v
+ end
+ return u
+ else return t end
+end
+
+local function tput(putt)
+ putt = override(putt)
+ socket.try(putt.host, "missing hostname")
+ local f = _M.open(putt.host, putt.port, putt.create)
+ f:greet()
+ f:login(putt.user, putt.password)
+ if putt.type then f:type(putt.type) end
+ f:pasv()
+ local sent = f:send(putt)
+ f:quit()
+ f:close()
+ return sent
+end
+
+local default = {
+ path = "/",
+ scheme = "ftp"
+}
+
+local function parse(u)
+ local t = socket.try(url.parse(u, default))
+ socket.try(t.scheme == "ftp", "wrong scheme '" .. t.scheme .. "'")
+ socket.try(t.host, "missing hostname")
+ local pat = "^type=(.)$"
+ if t.params then
+ t.type = socket.skip(2, string.find(t.params, pat))
+ socket.try(t.type == "a" or t.type == "i",
+ "invalid type '" .. t.type .. "'")
+ end
+ return t
+end
+
+local function sput(u, body)
+ local putt = parse(u)
+ putt.source = ltn12.source.string(body)
+ return tput(putt)
+end
+
+_M.put = socket.protect(function(putt, body)
+ if base.type(putt) == "string" then return sput(putt, body)
+ else return tput(putt) end
+end)
+
+local function tget(gett)
+ gett = override(gett)
+ socket.try(gett.host, "missing hostname")
+ local f = _M.open(gett.host, gett.port, gett.create)
+ f:greet()
+ f:login(gett.user, gett.password)
+ if gett.type then f:type(gett.type) end
+ f:pasv()
+ f:receive(gett)
+ f:quit()
+ return f:close()
+end
+
+local function sget(u)
+ local gett = parse(u)
+ local t = {}
+ gett.sink = ltn12.sink.table(t)
+ tget(gett)
+ return table.concat(t)
+end
+
+_M.command = socket.protect(function(cmdt)
+ cmdt = override(cmdt)
+ socket.try(cmdt.host, "missing hostname")
+ socket.try(cmdt.command, "missing command")
+ local f = open(cmdt.host, cmdt.port, cmdt.create)
+ f:greet()
+ f:login(cmdt.user, cmdt.password)
+ f.try(f.tp:command(cmdt.command, cmdt.argument))
+ if cmdt.check then f.try(f.tp:check(cmdt.check)) end
+ f:quit()
+ return f:close()
+end)
+
+_M.get = socket.protect(function(gett)
+ if base.type(gett) == "string" then return sget(gett)
+ else return tget(gett) end
+end)
+
+return _M
\ No newline at end of file
diff --git a/src/headers.lua b/src/headers.lua
new file mode 100644
index 0000000..1eb8223
--- /dev/null
+++ b/src/headers.lua
@@ -0,0 +1,104 @@
+-----------------------------------------------------------------------------
+-- Canonic header field capitalization
+-- LuaSocket toolkit.
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+local socket = require("socket")
+socket.headers = {}
+local _M = socket.headers
+
+_M.canonic = {
+ ["accept"] = "Accept",
+ ["accept-charset"] = "Accept-Charset",
+ ["accept-encoding"] = "Accept-Encoding",
+ ["accept-language"] = "Accept-Language",
+ ["accept-ranges"] = "Accept-Ranges",
+ ["action"] = "Action",
+ ["alternate-recipient"] = "Alternate-Recipient",
+ ["age"] = "Age",
+ ["allow"] = "Allow",
+ ["arrival-date"] = "Arrival-Date",
+ ["authorization"] = "Authorization",
+ ["bcc"] = "Bcc",
+ ["cache-control"] = "Cache-Control",
+ ["cc"] = "Cc",
+ ["comments"] = "Comments",
+ ["connection"] = "Connection",
+ ["content-description"] = "Content-Description",
+ ["content-disposition"] = "Content-Disposition",
+ ["content-encoding"] = "Content-Encoding",
+ ["content-id"] = "Content-ID",
+ ["content-language"] = "Content-Language",
+ ["content-length"] = "Content-Length",
+ ["content-location"] = "Content-Location",
+ ["content-md5"] = "Content-MD5",
+ ["content-range"] = "Content-Range",
+ ["content-transfer-encoding"] = "Content-Transfer-Encoding",
+ ["content-type"] = "Content-Type",
+ ["cookie"] = "Cookie",
+ ["date"] = "Date",
+ ["diagnostic-code"] = "Diagnostic-Code",
+ ["dsn-gateway"] = "DSN-Gateway",
+ ["etag"] = "ETag",
+ ["expect"] = "Expect",
+ ["expires"] = "Expires",
+ ["final-log-id"] = "Final-Log-ID",
+ ["final-recipient"] = "Final-Recipient",
+ ["from"] = "From",
+ ["host"] = "Host",
+ ["if-match"] = "If-Match",
+ ["if-modified-since"] = "If-Modified-Since",
+ ["if-none-match"] = "If-None-Match",
+ ["if-range"] = "If-Range",
+ ["if-unmodified-since"] = "If-Unmodified-Since",
+ ["in-reply-to"] = "In-Reply-To",
+ ["keywords"] = "Keywords",
+ ["last-attempt-date"] = "Last-Attempt-Date",
+ ["last-modified"] = "Last-Modified",
+ ["location"] = "Location",
+ ["max-forwards"] = "Max-Forwards",
+ ["message-id"] = "Message-ID",
+ ["mime-version"] = "MIME-Version",
+ ["original-envelope-id"] = "Original-Envelope-ID",
+ ["original-recipient"] = "Original-Recipient",
+ ["pragma"] = "Pragma",
+ ["proxy-authenticate"] = "Proxy-Authenticate",
+ ["proxy-authorization"] = "Proxy-Authorization",
+ ["range"] = "Range",
+ ["received"] = "Received",
+ ["received-from-mta"] = "Received-From-MTA",
+ ["references"] = "References",
+ ["referer"] = "Referer",
+ ["remote-mta"] = "Remote-MTA",
+ ["reply-to"] = "Reply-To",
+ ["reporting-mta"] = "Reporting-MTA",
+ ["resent-bcc"] = "Resent-Bcc",
+ ["resent-cc"] = "Resent-Cc",
+ ["resent-date"] = "Resent-Date",
+ ["resent-from"] = "Resent-From",
+ ["resent-message-id"] = "Resent-Message-ID",
+ ["resent-reply-to"] = "Resent-Reply-To",
+ ["resent-sender"] = "Resent-Sender",
+ ["resent-to"] = "Resent-To",
+ ["retry-after"] = "Retry-After",
+ ["return-path"] = "Return-Path",
+ ["sender"] = "Sender",
+ ["server"] = "Server",
+ ["smtp-remote-recipient"] = "SMTP-Remote-Recipient",
+ ["status"] = "Status",
+ ["subject"] = "Subject",
+ ["te"] = "TE",
+ ["to"] = "To",
+ ["trailer"] = "Trailer",
+ ["transfer-encoding"] = "Transfer-Encoding",
+ ["upgrade"] = "Upgrade",
+ ["user-agent"] = "User-Agent",
+ ["vary"] = "Vary",
+ ["via"] = "Via",
+ ["warning"] = "Warning",
+ ["will-retry-until"] = "Will-Retry-Until",
+ ["www-authenticate"] = "WWW-Authenticate",
+ ["x-mailer"] = "X-Mailer",
+}
+
+return _M
\ No newline at end of file
diff --git a/src/http.lua b/src/http.lua
new file mode 100644
index 0000000..ac4b2d6
--- /dev/null
+++ b/src/http.lua
@@ -0,0 +1,354 @@
+-----------------------------------------------------------------------------
+-- HTTP/1.1 client support for the Lua language.
+-- LuaSocket toolkit.
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+
+-----------------------------------------------------------------------------
+-- Declare module and import dependencies
+-------------------------------------------------------------------------------
+local socket = require("socket")
+local url = require("socket.url")
+local ltn12 = require("ltn12")
+local mime = require("mime")
+local string = require("string")
+local headers = require("socket.headers")
+local base = _G
+local table = require("table")
+socket.http = {}
+local _M = socket.http
+
+-----------------------------------------------------------------------------
+-- Program constants
+-----------------------------------------------------------------------------
+-- connection timeout in seconds
+TIMEOUT = 60
+-- default port for document retrieval
+_M.PORT = 80
+-- user agent field sent in request
+_M.USERAGENT = socket._VERSION
+
+-----------------------------------------------------------------------------
+-- Reads MIME headers from a connection, unfolding where needed
+-----------------------------------------------------------------------------
+local function receiveheaders(sock, headers)
+ local line, name, value, err
+ headers = headers or {}
+ -- get first line
+ line, err = sock:receive()
+ if err then return nil, err end
+ -- headers go until a blank line is found
+ while line ~= "" do
+ -- get field-name and value
+ name, value = socket.skip(2, string.find(line, "^(.-):%s*(.*)"))
+ if not (name and value) then return nil, "malformed reponse headers" end
+ name = string.lower(name)
+ -- get next line (value might be folded)
+ line, err = sock:receive()
+ if err then return nil, err end
+ -- unfold any folded values
+ while string.find(line, "^%s") do
+ value = value .. line
+ line = sock:receive()
+ if err then return nil, err end
+ end
+ -- save pair in table
+ if headers[name] then headers[name] = headers[name] .. ", " .. value
+ else headers[name] = value end
+ end
+ return headers
+end
+
+-----------------------------------------------------------------------------
+-- Extra sources and sinks
+-----------------------------------------------------------------------------
+socket.sourcet["http-chunked"] = function(sock, headers)
+ return base.setmetatable({
+ getfd = function() return sock:getfd() end,
+ dirty = function() return sock:dirty() end
+ }, {
+ __call = function()
+ -- get chunk size, skip extention
+ local line, err = sock:receive()
+ if err then return nil, err end
+ local size = base.tonumber(string.gsub(line, ";.*", ""), 16)
+ if not size then return nil, "invalid chunk size" end
+ -- was it the last chunk?
+ if size > 0 then
+ -- if not, get chunk and skip terminating CRLF
+ local chunk, err, part = sock:receive(size)
+ if chunk then sock:receive() end
+ return chunk, err
+ else
+ -- if it was, read trailers into headers table
+ headers, err = receiveheaders(sock, headers)
+ if not headers then return nil, err end
+ end
+ end
+ })
+end
+
+socket.sinkt["http-chunked"] = function(sock)
+ return base.setmetatable({
+ getfd = function() return sock:getfd() end,
+ dirty = function() return sock:dirty() end
+ }, {
+ __call = function(self, chunk, err)
+ if not chunk then return sock:send("0\r\n\r\n") end
+ local size = string.format("%X\r\n", string.len(chunk))
+ return sock:send(size .. chunk .. "\r\n")
+ end
+ })
+end
+
+-----------------------------------------------------------------------------
+-- Low level HTTP API
+-----------------------------------------------------------------------------
+local metat = { __index = {} }
+
+function _M.open(host, port, create)
+ -- create socket with user connect function, or with default
+ local c = socket.try((create or socket.tcp)())
+ local h = base.setmetatable({ c = c }, metat)
+ -- create finalized try
+ h.try = socket.newtry(function() h:close() end)
+ -- set timeout before connecting
+ h.try(c:settimeout(_M.TIMEOUT))
+ h.try(c:connect(host, port or _M.PORT))
+ -- here everything worked
+ return h
+end
+
+function metat.__index:sendrequestline(method, uri)
+ local reqline = string.format("%s %s HTTP/1.1\r\n", method or "GET", uri)
+ return self.try(self.c:send(reqline))
+end
+
+function metat.__index:sendheaders(tosend)
+ local canonic = headers.canonic
+ local h = "\r\n"
+ for f, v in base.pairs(tosend) do
+ h = (canonic[f] or f) .. ": " .. v .. "\r\n" .. h
+ end
+ self.try(self.c:send(h))
+ return 1
+end
+
+function metat.__index:sendbody(headers, source, step)
+ source = source or ltn12.source.empty()
+ step = step or ltn12.pump.step
+ -- if we don't know the size in advance, send chunked and hope for the best
+ local mode = "http-chunked"
+ if headers["content-length"] then mode = "keep-open" end
+ return self.try(ltn12.pump.all(source, socket.sink(mode, self.c), step))
+end
+
+function metat.__index:receivestatusline()
+ local status = self.try(self.c:receive(5))
+ -- identify HTTP/0.9 responses, which do not contain a status line
+ -- this is just a heuristic, but is what the RFC recommends
+ if status ~= "HTTP/" then return nil, status end
+ -- otherwise proceed reading a status line
+ status = self.try(self.c:receive("*l", status))
+ local code = socket.skip(2, string.find(status, "HTTP/%d*%.%d* (%d%d%d)"))
+ return self.try(base.tonumber(code), status)
+end
+
+function metat.__index:receiveheaders()
+ return self.try(receiveheaders(self.c))
+end
+
+function metat.__index:receivebody(headers, sink, step)
+ sink = sink or ltn12.sink.null()
+ step = step or ltn12.pump.step
+ local length = base.tonumber(headers["content-length"])
+ local t = headers["transfer-encoding"] -- shortcut
+ local mode = "default" -- connection close
+ if t and t ~= "identity" then mode = "http-chunked"
+ elseif base.tonumber(headers["content-length"]) then mode = "by-length" end
+ return self.try(ltn12.pump.all(socket.source(mode, self.c, length),
+ sink, step))
+end
+
+function metat.__index:receive09body(status, sink, step)
+ local source = ltn12.source.rewind(socket.source("until-closed", self.c))
+ source(status)
+ return self.try(ltn12.pump.all(source, sink, step))
+end
+
+function metat.__index:close()
+ return self.c:close()
+end
+
+-----------------------------------------------------------------------------
+-- High level HTTP API
+-----------------------------------------------------------------------------
+local function adjusturi(reqt)
+ local u = reqt
+ -- if there is a proxy, we need the full url. otherwise, just a part.
+ if not reqt.proxy and not PROXY then
+ u = {
+ path = socket.try(reqt.path, "invalid path 'nil'"),
+ params = reqt.params,
+ query = reqt.query,
+ fragment = reqt.fragment
+ }
+ end
+ return url.build(u)
+end
+
+local function adjustproxy(reqt)
+ local proxy = reqt.proxy or PROXY
+ if proxy then
+ proxy = url.parse(proxy)
+ return proxy.host, proxy.port or 3128
+ else
+ return reqt.host, reqt.port
+ end
+end
+
+local function adjustheaders(reqt)
+ -- default headers
+ local lower = {
+ ["user-agent"] = _M.USERAGENT,
+ ["host"] = reqt.host,
+ ["connection"] = "close, TE",
+ ["te"] = "trailers"
+ }
+ -- if we have authentication information, pass it along
+ if reqt.user and reqt.password then
+ lower["authorization"] =
+ "Basic " .. (mime.b64(reqt.user .. ":" .. reqt.password))
+ end
+ -- override with user headers
+ for i,v in base.pairs(reqt.headers or lower) do
+ lower[string.lower(i)] = v
+ end
+ return lower
+end
+
+-- default url parts
+local default = {
+ host = "",
+ port = _M.PORT,
+ path ="/",
+ scheme = "http"
+}
+
+local function adjustrequest(reqt)
+ -- parse url if provided
+ local nreqt = reqt.url and url.parse(reqt.url, default) or {}
+ -- explicit components override url
+ for i,v in base.pairs(reqt) do nreqt[i] = v end
+ if nreqt.port == "" then nreqt.port = 80 end
+ socket.try(nreqt.host and nreqt.host ~= "",
+ "invalid host '" .. base.tostring(nreqt.host) .. "'")
+ -- compute uri if user hasn't overriden
+ nreqt.uri = reqt.uri or adjusturi(nreqt)
+ -- ajust host and port if there is a proxy
+ nreqt.host, nreqt.port = adjustproxy(nreqt)
+ -- adjust headers in request
+ nreqt.headers = adjustheaders(nreqt)
+ return nreqt
+end
+
+local function shouldredirect(reqt, code, headers)
+ return headers.location and
+ string.gsub(headers.location, "%s", "") ~= "" and
+ (reqt.redirect ~= false) and
+ (code == 301 or code == 302 or code == 303 or code == 307) and
+ (not reqt.method or reqt.method == "GET" or reqt.method == "HEAD")
+ and (not reqt.nredirects or reqt.nredirects < 5)
+end
+
+local function shouldreceivebody(reqt, code)
+ if reqt.method == "HEAD" then return nil end
+ if code == 204 or code == 304 then return nil end
+ if code >= 100 and code < 200 then return nil end
+ return 1
+end
+
+-- forward declarations
+local trequest, tredirect
+
+--[[local]] function tredirect(reqt, location)
+ local result, code, headers, status = trequest {
+ -- the RFC says the redirect URL has to be absolute, but some
+ -- servers do not respect that
+ url = url.absolute(reqt.url, location),
+ source = reqt.source,
+ sink = reqt.sink,
+ headers = reqt.headers,
+ proxy = reqt.proxy,
+ nredirects = (reqt.nredirects or 0) + 1,
+ create = reqt.create
+ }
+ -- pass location header back as a hint we redirected
+ headers = headers or {}
+ headers.location = headers.location or location
+ return result, code, headers, status
+end
+
+--[[local]] function trequest(reqt)
+ -- we loop until we get what we want, or
+ -- until we are sure there is no way to get it
+ local nreqt = adjustrequest(reqt)
+ local h = _M.open(nreqt.host, nreqt.port, nreqt.create)
+ -- send request line and headers
+ h:sendrequestline(nreqt.method, nreqt.uri)
+ h:sendheaders(nreqt.headers)
+ -- if there is a body, send it
+ if nreqt.source then
+ h:sendbody(nreqt.headers, nreqt.source, nreqt.step)
+ end
+ local code, status = h:receivestatusline()
+ -- if it is an HTTP/0.9 server, simply get the body and we are done
+ if not code then
+ h:receive09body(status, nreqt.sink, nreqt.step)
+ return 1, 200
+ end
+ local headers
+ -- ignore any 100-continue messages
+ while code == 100 do
+ headers = h:receiveheaders()
+ code, status = h:receivestatusline()
+ end
+ headers = h:receiveheaders()
+ -- at this point we should have a honest reply from the server
+ -- we can't redirect if we already used the source, so we report the error
+ if shouldredirect(nreqt, code, headers) and not nreqt.source then
+ h:close()
+ return tredirect(reqt, headers.location)
+ end
+ -- here we are finally done
+ if shouldreceivebody(nreqt, code) then
+ h:receivebody(headers, nreqt.sink, nreqt.step)
+ end
+ h:close()
+ return 1, code, headers, status
+end
+
+local function srequest(u, b)
+ local t = {}
+ local reqt = {
+ url = u,
+ sink = ltn12.sink.table(t)
+ }
+ if b then
+ reqt.source = ltn12.source.string(b)
+ reqt.headers = {
+ ["content-length"] = string.len(b),
+ ["content-type"] = "application/x-www-form-urlencoded"
+ }
+ reqt.method = "POST"
+ end
+ local code, headers, status = socket.skip(1, trequest(reqt))
+ return table.concat(t), code, headers, status
+end
+
+_M.request = socket.protect(function(reqt, body)
+ if base.type(reqt) == "string" then return srequest(reqt, body)
+ else return trequest(reqt) end
+end)
+
+return _M
\ No newline at end of file
diff --git a/src/inet.c b/src/inet.c
new file mode 100644
index 0000000..1a411f6
--- /dev/null
+++ b/src/inet.c
@@ -0,0 +1,536 @@
+/*=========================================================================*\
+* Internet domain functions
+* LuaSocket toolkit
+\*=========================================================================*/
+#include
+#include
+#include
+
+#include "lua.h"
+#include "lauxlib.h"
+
+#include "inet.h"
+
+/*=========================================================================*\
+* Internal function prototypes.
+\*=========================================================================*/
+static int inet_global_toip(lua_State *L);
+static int inet_global_getaddrinfo(lua_State *L);
+static int inet_global_tohostname(lua_State *L);
+static int inet_global_getnameinfo(lua_State *L);
+static void inet_pushresolved(lua_State *L, struct hostent *hp);
+static int inet_global_gethostname(lua_State *L);
+
+/* DNS functions */
+static luaL_Reg func[] = {
+ { "toip", inet_global_toip},
+ { "getaddrinfo", inet_global_getaddrinfo},
+ { "tohostname", inet_global_tohostname},
+ { "getnameinfo", inet_global_getnameinfo},
+ { "gethostname", inet_global_gethostname},
+ { NULL, NULL}
+};
+
+/*=========================================================================*\
+* Exported functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Initializes module
+\*-------------------------------------------------------------------------*/
+int inet_open(lua_State *L)
+{
+ lua_pushstring(L, "dns");
+ lua_newtable(L);
+#if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE)
+ luaL_setfuncs(L, func, 0);
+#else
+ luaL_openlib(L, NULL, func, 0);
+#endif
+ lua_settable(L, -3);
+ return 0;
+}
+
+/*=========================================================================*\
+* Global Lua functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Returns all information provided by the resolver given a host name
+* or ip address
+\*-------------------------------------------------------------------------*/
+static int inet_gethost(const char *address, struct hostent **hp) {
+ struct in_addr addr;
+ if (inet_aton(address, &addr))
+ return socket_gethostbyaddr((char *) &addr, sizeof(addr), hp);
+ else
+ return socket_gethostbyname(address, hp);
+}
+
+/*-------------------------------------------------------------------------*\
+* Returns all information provided by the resolver given a host name
+* or ip address
+\*-------------------------------------------------------------------------*/
+static int inet_global_tohostname(lua_State *L) {
+ const char *address = luaL_checkstring(L, 1);
+ struct hostent *hp = NULL;
+ int err = inet_gethost(address, &hp);
+ if (err != IO_DONE) {
+ lua_pushnil(L);
+ lua_pushstring(L, socket_hoststrerror(err));
+ return 2;
+ }
+ lua_pushstring(L, hp->h_name);
+ inet_pushresolved(L, hp);
+ return 2;
+}
+
+static int inet_global_getnameinfo(lua_State *L) {
+ char hbuf[NI_MAXHOST];
+ char sbuf[NI_MAXSERV];
+ int i, ret;
+ struct addrinfo hints;
+ struct addrinfo *resolved, *iter;
+ const char *host = luaL_optstring(L, 1, NULL);
+ const char *serv = luaL_optstring(L, 2, NULL);
+
+ if (!(host || serv))
+ luaL_error(L, "host and serv cannot be both nil");
+
+ memset(&hints, 0, sizeof(hints));
+ hints.ai_socktype = SOCK_STREAM;
+ hints.ai_family = PF_UNSPEC;
+
+ ret = getaddrinfo(host, serv, &hints, &resolved);
+ if (ret != 0) {
+ lua_pushnil(L);
+ lua_pushstring(L, socket_gaistrerror(ret));
+ return 2;
+ }
+
+ lua_newtable(L);
+ for (i = 1, iter = resolved; iter; i++, iter = iter->ai_next) {
+ getnameinfo(iter->ai_addr, (socklen_t) iter->ai_addrlen,
+ hbuf, host? (socklen_t) sizeof(hbuf): 0,
+ sbuf, serv? (socklen_t) sizeof(sbuf): 0, 0);
+ if (host) {
+ lua_pushnumber(L, i);
+ lua_pushstring(L, hbuf);
+ lua_settable(L, -3);
+ }
+ }
+ freeaddrinfo(resolved);
+
+ if (serv) {
+ lua_pushstring(L, sbuf);
+ return 2;
+ } else {
+ return 1;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Returns all information provided by the resolver given a host name
+* or ip address
+\*-------------------------------------------------------------------------*/
+static int inet_global_toip(lua_State *L)
+{
+ const char *address = luaL_checkstring(L, 1);
+ struct hostent *hp = NULL;
+ int err = inet_gethost(address, &hp);
+ if (err != IO_DONE) {
+ lua_pushnil(L);
+ lua_pushstring(L, socket_hoststrerror(err));
+ return 2;
+ }
+ lua_pushstring(L, inet_ntoa(*((struct in_addr *) hp->h_addr)));
+ inet_pushresolved(L, hp);
+ return 2;
+}
+
+int inet_optfamily(lua_State* L, int narg, const char* def)
+{
+ static const char* optname[] = { "unspec", "inet", "inet6", NULL };
+ static int optvalue[] = { PF_UNSPEC, PF_INET, PF_INET6, 0 };
+
+ return optvalue[luaL_checkoption(L, narg, def, optname)];
+}
+
+int inet_optsocktype(lua_State* L, int narg, const char* def)
+{
+ static const char* optname[] = { "stream", "dgram", NULL };
+ static int optvalue[] = { SOCK_STREAM, SOCK_DGRAM, 0 };
+
+ return optvalue[luaL_checkoption(L, narg, def, optname)];
+}
+
+static int inet_global_getaddrinfo(lua_State *L)
+{
+ const char *hostname = luaL_checkstring(L, 1);
+ struct addrinfo *iterator = NULL, *resolved = NULL;
+ struct addrinfo hints;
+ int i = 1, ret = 0;
+ memset(&hints, 0, sizeof(hints));
+ hints.ai_socktype = SOCK_STREAM;
+ hints.ai_family = PF_UNSPEC;
+ ret = getaddrinfo(hostname, NULL, &hints, &resolved);
+ if (ret != 0) {
+ lua_pushnil(L);
+ lua_pushstring(L, socket_gaistrerror(ret));
+ return 2;
+ }
+ lua_newtable(L);
+ for (iterator = resolved; iterator; iterator = iterator->ai_next) {
+ char hbuf[NI_MAXHOST];
+ ret = getnameinfo(iterator->ai_addr, (socklen_t) iterator->ai_addrlen,
+ hbuf, (socklen_t) sizeof(hbuf), NULL, 0, NI_NUMERICHOST);
+ if (ret){
+ lua_pushnil(L);
+ lua_pushstring(L, socket_gaistrerror(ret));
+ return 2;
+ }
+ lua_pushnumber(L, i);
+ lua_newtable(L);
+ switch (iterator->ai_family) {
+ case AF_INET:
+ lua_pushliteral(L, "family");
+ lua_pushliteral(L, "inet");
+ lua_settable(L, -3);
+ break;
+ case AF_INET6:
+ lua_pushliteral(L, "family");
+ lua_pushliteral(L, "inet6");
+ lua_settable(L, -3);
+ break;
+ }
+ lua_pushliteral(L, "addr");
+ lua_pushstring(L, hbuf);
+ lua_settable(L, -3);
+ lua_settable(L, -3);
+ i++;
+ }
+ freeaddrinfo(resolved);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Gets the host name
+\*-------------------------------------------------------------------------*/
+static int inet_global_gethostname(lua_State *L)
+{
+ char name[257];
+ name[256] = '\0';
+ if (gethostname(name, 256) < 0) {
+ lua_pushnil(L);
+ lua_pushstring(L, socket_strerror(errno));
+ return 2;
+ } else {
+ lua_pushstring(L, name);
+ return 1;
+ }
+}
+
+/*=========================================================================*\
+* Lua methods
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Retrieves socket peer name
+\*-------------------------------------------------------------------------*/
+int inet_meth_getpeername(lua_State *L, p_socket ps, int family)
+{
+ int err;
+ struct sockaddr_storage peer;
+ socklen_t peer_len = sizeof(peer);
+ char name[INET6_ADDRSTRLEN];
+ char port[6]; /* 65535 = 5 bytes + 0 to terminate it */
+ if (getpeername(*ps, (SA *) &peer, &peer_len) < 0) {
+ lua_pushnil(L);
+ lua_pushstring(L, socket_strerror(errno));
+ return 2;
+ }
+ err = getnameinfo((struct sockaddr *) &peer, peer_len,
+ name, INET6_ADDRSTRLEN,
+ port, sizeof(port), NI_NUMERICHOST | NI_NUMERICSERV);
+ if (err) {
+ lua_pushnil(L);
+ lua_pushstring(L, gai_strerror(err));
+ return 2;
+ }
+ lua_pushstring(L, name);
+ lua_pushinteger(L, (int) strtol(port, (char **) NULL, 10));
+ if (family == PF_INET) {
+ lua_pushliteral(L, "inet");
+ } else if (family == PF_INET6) {
+ lua_pushliteral(L, "inet6");
+ } else {
+ lua_pushliteral(L, "uknown family");
+ }
+ return 3;
+}
+
+/*-------------------------------------------------------------------------*\
+* Retrieves socket local name
+\*-------------------------------------------------------------------------*/
+int inet_meth_getsockname(lua_State *L, p_socket ps, int family)
+{
+ int err;
+ struct sockaddr_storage peer;
+ socklen_t peer_len = sizeof(peer);
+ char name[INET6_ADDRSTRLEN];
+ char port[6]; /* 65535 = 5 bytes + 0 to terminate it */
+ if (getsockname(*ps, (SA *) &peer, &peer_len) < 0) {
+ lua_pushnil(L);
+ lua_pushstring(L, socket_strerror(errno));
+ return 2;
+ }
+ err=getnameinfo((struct sockaddr *)&peer, peer_len,
+ name, INET6_ADDRSTRLEN, port, 6, NI_NUMERICHOST | NI_NUMERICSERV);
+ if (err) {
+ lua_pushnil(L);
+ lua_pushstring(L, gai_strerror(err));
+ return 2;
+ }
+ lua_pushstring(L, name);
+ lua_pushstring(L, port);
+ if (family == PF_INET) {
+ lua_pushliteral(L, "inet");
+ } else if (family == PF_INET6) {
+ lua_pushliteral(L, "inet6");
+ } else {
+ lua_pushliteral(L, "uknown family");
+ }
+ return 3;
+}
+
+/*=========================================================================*\
+* Internal functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Passes all resolver information to Lua as a table
+\*-------------------------------------------------------------------------*/
+static void inet_pushresolved(lua_State *L, struct hostent *hp)
+{
+ char **alias;
+ struct in_addr **addr;
+ int i, resolved;
+ lua_newtable(L); resolved = lua_gettop(L);
+ lua_pushstring(L, "name");
+ lua_pushstring(L, hp->h_name);
+ lua_settable(L, resolved);
+ lua_pushstring(L, "ip");
+ lua_pushstring(L, "alias");
+ i = 1;
+ alias = hp->h_aliases;
+ lua_newtable(L);
+ if (alias) {
+ while (*alias) {
+ lua_pushnumber(L, i);
+ lua_pushstring(L, *alias);
+ lua_settable(L, -3);
+ i++; alias++;
+ }
+ }
+ lua_settable(L, resolved);
+ i = 1;
+ lua_newtable(L);
+ addr = (struct in_addr **) hp->h_addr_list;
+ if (addr) {
+ while (*addr) {
+ lua_pushnumber(L, i);
+ lua_pushstring(L, inet_ntoa(**addr));
+ lua_settable(L, -3);
+ i++; addr++;
+ }
+ }
+ lua_settable(L, resolved);
+}
+
+/*-------------------------------------------------------------------------*\
+* Tries to create a new inet socket
+\*-------------------------------------------------------------------------*/
+const char *inet_trycreate(p_socket ps, int family, int type) {
+ return socket_strerror(socket_create(ps, family, type, 0));
+}
+
+/*-------------------------------------------------------------------------*\
+* "Disconnects" a DGRAM socket
+\*-------------------------------------------------------------------------*/
+const char *inet_trydisconnect(p_socket ps, int family, p_timeout tm)
+{
+ switch (family) {
+ case PF_INET: {
+ struct sockaddr_in sin;
+ memset((char *) &sin, 0, sizeof(sin));
+ sin.sin_family = AF_UNSPEC;
+ sin.sin_addr.s_addr = INADDR_ANY;
+ return socket_strerror(socket_connect(ps, (SA *) &sin,
+ sizeof(sin), tm));
+ }
+ case PF_INET6: {
+ struct sockaddr_in6 sin6;
+ struct in6_addr addrany = IN6ADDR_ANY_INIT;
+ memset((char *) &sin6, 0, sizeof(sin6));
+ sin6.sin6_family = AF_UNSPEC;
+ sin6.sin6_addr = addrany;
+ return socket_strerror(socket_connect(ps, (SA *) &sin6,
+ sizeof(sin6), tm));
+ }
+ }
+ return NULL;
+}
+
+/*-------------------------------------------------------------------------*\
+* Tries to connect to remote address (address, port)
+\*-------------------------------------------------------------------------*/
+const char *inet_tryconnect(p_socket ps, int *family, const char *address,
+ const char *serv, p_timeout tm, struct addrinfo *connecthints)
+{
+ struct addrinfo *iterator = NULL, *resolved = NULL;
+ const char *err = NULL;
+ /* try resolving */
+ err = socket_gaistrerror(getaddrinfo(address, serv,
+ connecthints, &resolved));
+ if (err != NULL) {
+ if (resolved) freeaddrinfo(resolved);
+ return err;
+ }
+ for (iterator = resolved; iterator; iterator = iterator->ai_next) {
+ timeout_markstart(tm);
+ /* create new socket if necessary. if there was no
+ * bind, we need to create one for every new family
+ * that shows up while iterating. if there was a
+ * bind, all families will be the same and we will
+ * not enter this branch. */
+ if (*family != iterator->ai_family) {
+ socket_destroy(ps);
+ err = socket_strerror(socket_create(ps, iterator->ai_family,
+ iterator->ai_socktype, iterator->ai_protocol));
+ if (err != NULL) {
+ freeaddrinfo(resolved);
+ return err;
+ }
+ *family = iterator->ai_family;
+ /* all sockets initially non-blocking */
+ socket_setnonblocking(ps);
+ }
+ /* try connecting to remote address */
+ err = socket_strerror(socket_connect(ps, (SA *) iterator->ai_addr,
+ (socklen_t) iterator->ai_addrlen, tm));
+ /* if success, break out of loop */
+ if (err == NULL) break;
+ }
+ freeaddrinfo(resolved);
+ /* here, if err is set, we failed */
+ return err;
+}
+
+/*-------------------------------------------------------------------------*\
+* Tries to accept a socket
+\*-------------------------------------------------------------------------*/
+const char *inet_tryaccept(p_socket server, int family, p_socket client,
+ p_timeout tm)
+{
+ socklen_t len;
+ t_sockaddr_storage addr;
+ if (family == PF_INET6) {
+ len = sizeof(struct sockaddr_in6);
+ } else {
+ len = sizeof(struct sockaddr_in);
+ }
+ return socket_strerror(socket_accept(server, client, (SA *) &addr,
+ &len, tm));
+}
+
+/*-------------------------------------------------------------------------*\
+* Tries to bind socket to (address, port)
+\*-------------------------------------------------------------------------*/
+const char *inet_trybind(p_socket ps, const char *address, const char *serv,
+ struct addrinfo *bindhints)
+{
+ struct addrinfo *iterator = NULL, *resolved = NULL;
+ const char *err = NULL;
+ t_socket sock = *ps;
+ /* translate luasocket special values to C */
+ if (strcmp(address, "*") == 0) address = NULL;
+ if (!serv) serv = "0";
+ /* try resolving */
+ err = socket_gaistrerror(getaddrinfo(address, serv, bindhints, &resolved));
+ if (err) {
+ if (resolved) freeaddrinfo(resolved);
+ return err;
+ }
+ /* iterate over resolved addresses until one is good */
+ for (iterator = resolved; iterator; iterator = iterator->ai_next) {
+ if(sock == SOCKET_INVALID) {
+ err = socket_strerror(socket_create(&sock, iterator->ai_family,
+ iterator->ai_socktype, iterator->ai_protocol));
+ if(err)
+ continue;
+ }
+ /* try binding to local address */
+ err = socket_strerror(socket_bind(&sock,
+ (SA *) iterator->ai_addr,
+ (socklen_t) iterator->ai_addrlen));
+
+ /* keep trying unless bind succeeded */
+ if (err) {
+ if(sock != *ps)
+ socket_destroy(&sock);
+ } else {
+ /* remember what we connected to, particularly the family */
+ *bindhints = *iterator;
+ break;
+ }
+ }
+ /* cleanup and return error */
+ freeaddrinfo(resolved);
+ *ps = sock;
+ return err;
+}
+
+/*-------------------------------------------------------------------------*\
+* Some systems do not provide these so that we provide our own.
+\*-------------------------------------------------------------------------*/
+#ifdef LUASOCKET_INET_ATON
+int inet_aton(const char *cp, struct in_addr *inp)
+{
+ unsigned int a = 0, b = 0, c = 0, d = 0;
+ int n = 0, r;
+ unsigned long int addr = 0;
+ r = sscanf(cp, "%u.%u.%u.%u%n", &a, &b, &c, &d, &n);
+ if (r == 0 || n == 0) return 0;
+ cp += n;
+ if (*cp) return 0;
+ if (a > 255 || b > 255 || c > 255 || d > 255) return 0;
+ if (inp) {
+ addr += a; addr <<= 8;
+ addr += b; addr <<= 8;
+ addr += c; addr <<= 8;
+ addr += d;
+ inp->s_addr = htonl(addr);
+ }
+ return 1;
+}
+#endif
+
+#ifdef LUASOCKET_INET_PTON
+int inet_pton(int af, const char *src, void *dst)
+{
+ struct addrinfo hints, *res;
+ int ret = 1;
+ memset(&hints, 0, sizeof(struct addrinfo));
+ hints.ai_family = af;
+ hints.ai_flags = AI_NUMERICHOST;
+ if (getaddrinfo(src, NULL, &hints, &res) != 0) return -1;
+ if (af == AF_INET) {
+ struct sockaddr_in *in = (struct sockaddr_in *) res->ai_addr;
+ memcpy(dst, &in->sin_addr, sizeof(in->sin_addr));
+ } else if (af == AF_INET6) {
+ struct sockaddr_in6 *in = (struct sockaddr_in6 *) res->ai_addr;
+ memcpy(dst, &in->sin6_addr, sizeof(in->sin6_addr));
+ } else {
+ ret = -1;
+ }
+ freeaddrinfo(res);
+ return ret;
+}
+
+#endif
diff --git a/src/inet.h b/src/inet.h
new file mode 100644
index 0000000..1f1a96a
--- /dev/null
+++ b/src/inet.h
@@ -0,0 +1,50 @@
+#ifndef INET_H
+#define INET_H
+/*=========================================================================*\
+* Internet domain functions
+* LuaSocket toolkit
+*
+* This module implements the creation and connection of internet domain
+* sockets, on top of the socket.h interface, and the interface of with the
+* resolver.
+*
+* The function inet_aton is provided for the platforms where it is not
+* available. The module also implements the interface of the internet
+* getpeername and getsockname functions as seen by Lua programs.
+*
+* The Lua functions toip and tohostname are also implemented here.
+\*=========================================================================*/
+#include "lua.h"
+#include "socket.h"
+#include "timeout.h"
+
+#ifdef _WIN32
+#define LUASOCKET_INET_ATON
+#endif
+
+int inet_open(lua_State *L);
+
+const char *inet_trycreate(p_socket ps, int family, int type);
+const char *inet_tryconnect(p_socket ps, int *family, const char *address,
+ const char *serv, p_timeout tm, struct addrinfo *connecthints);
+const char *inet_trybind(p_socket ps, const char *address, const char *serv,
+ struct addrinfo *bindhints);
+const char *inet_trydisconnect(p_socket ps, int family, p_timeout tm);
+const char *inet_tryaccept(p_socket server, int family, p_socket client, p_timeout tm);
+
+int inet_meth_getpeername(lua_State *L, p_socket ps, int family);
+int inet_meth_getsockname(lua_State *L, p_socket ps, int family);
+
+int inet_optfamily(lua_State* L, int narg, const char* def);
+int inet_optsocktype(lua_State* L, int narg, const char* def);
+
+#ifdef LUASOCKET_INET_ATON
+int inet_aton(const char *cp, struct in_addr *inp);
+#endif
+
+#ifdef LUASOCKET_INET_PTON
+const char *inet_ntop(int af, const void *src, char *dst, socklen_t cnt);
+int inet_pton(int af, const char *src, void *dst);
+#endif
+
+#endif /* INET_H */
diff --git a/src/io.c b/src/io.c
new file mode 100644
index 0000000..35f46f7
--- /dev/null
+++ b/src/io.c
@@ -0,0 +1,30 @@
+/*=========================================================================*\
+* Input/Output abstraction
+* LuaSocket toolkit
+\*=========================================================================*/
+#include "io.h"
+
+/*=========================================================================*\
+* Exported functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Initializes C structure
+\*-------------------------------------------------------------------------*/
+void io_init(p_io io, p_send send, p_recv recv, p_error error, void *ctx) {
+ io->send = send;
+ io->recv = recv;
+ io->error = error;
+ io->ctx = ctx;
+}
+
+/*-------------------------------------------------------------------------*\
+* I/O error strings
+\*-------------------------------------------------------------------------*/
+const char *io_strerror(int err) {
+ switch (err) {
+ case IO_DONE: return NULL;
+ case IO_CLOSED: return "closed";
+ case IO_TIMEOUT: return "timeout";
+ default: return "unknown error";
+ }
+}
diff --git a/src/io.h b/src/io.h
new file mode 100644
index 0000000..76a3e58
--- /dev/null
+++ b/src/io.h
@@ -0,0 +1,65 @@
+#ifndef IO_H
+#define IO_H
+/*=========================================================================*\
+* Input/Output abstraction
+* LuaSocket toolkit
+*
+* This module defines the interface that LuaSocket expects from the
+* transport layer for streamed input/output. The idea is that if any
+* transport implements this interface, then the buffer.c functions
+* automatically work on it.
+*
+* The module socket.h implements this interface, and thus the module tcp.h
+* is very simple.
+\*=========================================================================*/
+#include
+#include "lua.h"
+
+#include "timeout.h"
+
+/* IO error codes */
+enum {
+ IO_DONE = 0, /* operation completed successfully */
+ IO_TIMEOUT = -1, /* operation timed out */
+ IO_CLOSED = -2, /* the connection has been closed */
+ IO_UNKNOWN = -3
+};
+
+/* interface to error message function */
+typedef const char *(*p_error) (
+ void *ctx, /* context needed by send */
+ int err /* error code */
+);
+
+/* interface to send function */
+typedef int (*p_send) (
+ void *ctx, /* context needed by send */
+ const char *data, /* pointer to buffer with data to send */
+ size_t count, /* number of bytes to send from buffer */
+ size_t *sent, /* number of bytes sent uppon return */
+ p_timeout tm /* timeout control */
+);
+
+/* interface to recv function */
+typedef int (*p_recv) (
+ void *ctx, /* context needed by recv */
+ char *data, /* pointer to buffer where data will be writen */
+ size_t count, /* number of bytes to receive into buffer */
+ size_t *got, /* number of bytes received uppon return */
+ p_timeout tm /* timeout control */
+);
+
+/* IO driver definition */
+typedef struct t_io_ {
+ void *ctx; /* context needed by send/recv */
+ p_send send; /* send function pointer */
+ p_recv recv; /* receive function pointer */
+ p_error error; /* strerror function */
+} t_io;
+typedef t_io *p_io;
+
+void io_init(p_io io, p_send send, p_recv recv, p_error error, void *ctx);
+const char *io_strerror(int err);
+
+#endif /* IO_H */
+
diff --git a/src/ltn12.lua b/src/ltn12.lua
new file mode 100644
index 0000000..8742b0e
--- /dev/null
+++ b/src/ltn12.lua
@@ -0,0 +1,298 @@
+-----------------------------------------------------------------------------
+-- LTN12 - Filters, sources, sinks and pumps.
+-- LuaSocket toolkit.
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+
+-----------------------------------------------------------------------------
+-- Declare module
+-----------------------------------------------------------------------------
+local string = require("string")
+local table = require("table")
+local base = _G
+local _M = {}
+if module then -- heuristic for exporting a global package table
+ ltn12 = _M
+end
+local filter,source,sink,pump = {},{},{},{}
+
+_M.filter = filter
+_M.source = source
+_M.sink = sink
+_M.pump = pump
+
+-- 2048 seems to be better in windows...
+_M.BLOCKSIZE = 2048
+_M._VERSION = "LTN12 1.0.2"
+
+-----------------------------------------------------------------------------
+-- Filter stuff
+-----------------------------------------------------------------------------
+-- returns a high level filter that cycles a low-level filter
+function filter.cycle(low, ctx, extra)
+ base.assert(low)
+ return function(chunk)
+ local ret
+ ret, ctx = low(ctx, chunk, extra)
+ return ret
+ end
+end
+
+-- chains a bunch of filters together
+-- (thanks to Wim Couwenberg)
+function filter.chain(...)
+ local arg = {...}
+ local n = select('#',...)
+ local top, index = 1, 1
+ local retry = ""
+ return function(chunk)
+ retry = chunk and retry
+ while true do
+ if index == top then
+ chunk = arg[index](chunk)
+ if chunk == "" or top == n then return chunk
+ elseif chunk then index = index + 1
+ else
+ top = top+1
+ index = top
+ end
+ else
+ chunk = arg[index](chunk or "")
+ if chunk == "" then
+ index = index - 1
+ chunk = retry
+ elseif chunk then
+ if index == n then return chunk
+ else index = index + 1 end
+ else base.error("filter returned inappropriate nil") end
+ end
+ end
+ end
+end
+
+-----------------------------------------------------------------------------
+-- Source stuff
+-----------------------------------------------------------------------------
+-- create an empty source
+local function empty()
+ return nil
+end
+
+function source.empty()
+ return empty
+end
+
+-- returns a source that just outputs an error
+function source.error(err)
+ return function()
+ return nil, err
+ end
+end
+
+-- creates a file source
+function source.file(handle, io_err)
+ if handle then
+ return function()
+ local chunk = handle:read(_M.BLOCKSIZE)
+ if not chunk then handle:close() end
+ return chunk
+ end
+ else return source.error(io_err or "unable to open file") end
+end
+
+-- turns a fancy source into a simple source
+function source.simplify(src)
+ base.assert(src)
+ return function()
+ local chunk, err_or_new = src()
+ src = err_or_new or src
+ if not chunk then return nil, err_or_new
+ else return chunk end
+ end
+end
+
+-- creates string source
+function source.string(s)
+ if s then
+ local i = 1
+ return function()
+ local chunk = string.sub(s, i, i+_M.BLOCKSIZE-1)
+ i = i + _M.BLOCKSIZE
+ if chunk ~= "" then return chunk
+ else return nil end
+ end
+ else return source.empty() end
+end
+
+-- creates rewindable source
+function source.rewind(src)
+ base.assert(src)
+ local t = {}
+ return function(chunk)
+ if not chunk then
+ chunk = table.remove(t)
+ if not chunk then return src()
+ else return chunk end
+ else
+ table.insert(t, chunk)
+ end
+ end
+end
+
+function source.chain(src, f)
+ base.assert(src and f)
+ local last_in, last_out = "", ""
+ local state = "feeding"
+ local err
+ return function()
+ if not last_out then
+ base.error('source is empty!', 2)
+ end
+ while true do
+ if state == "feeding" then
+ last_in, err = src()
+ if err then return nil, err end
+ last_out = f(last_in)
+ if not last_out then
+ if last_in then
+ base.error('filter returned inappropriate nil')
+ else
+ return nil
+ end
+ elseif last_out ~= "" then
+ state = "eating"
+ if last_in then last_in = "" end
+ return last_out
+ end
+ else
+ last_out = f(last_in)
+ if last_out == "" then
+ if last_in == "" then
+ state = "feeding"
+ else
+ base.error('filter returned ""')
+ end
+ elseif not last_out then
+ if last_in then
+ base.error('filter returned inappropriate nil')
+ else
+ return nil
+ end
+ else
+ return last_out
+ end
+ end
+ end
+ end
+end
+
+-- creates a source that produces contents of several sources, one after the
+-- other, as if they were concatenated
+-- (thanks to Wim Couwenberg)
+function source.cat(...)
+ local arg = {...}
+ local src = table.remove(arg, 1)
+ return function()
+ while src do
+ local chunk, err = src()
+ if chunk then return chunk end
+ if err then return nil, err end
+ src = table.remove(arg, 1)
+ end
+ end
+end
+
+-----------------------------------------------------------------------------
+-- Sink stuff
+-----------------------------------------------------------------------------
+-- creates a sink that stores into a table
+function sink.table(t)
+ t = t or {}
+ local f = function(chunk, err)
+ if chunk then table.insert(t, chunk) end
+ return 1
+ end
+ return f, t
+end
+
+-- turns a fancy sink into a simple sink
+function sink.simplify(snk)
+ base.assert(snk)
+ return function(chunk, err)
+ local ret, err_or_new = snk(chunk, err)
+ if not ret then return nil, err_or_new end
+ snk = err_or_new or snk
+ return 1
+ end
+end
+
+-- creates a file sink
+function sink.file(handle, io_err)
+ if handle then
+ return function(chunk, err)
+ if not chunk then
+ handle:close()
+ return 1
+ else return handle:write(chunk) end
+ end
+ else return sink.error(io_err or "unable to open file") end
+end
+
+-- creates a sink that discards data
+local function null()
+ return 1
+end
+
+function sink.null()
+ return null
+end
+
+-- creates a sink that just returns an error
+function sink.error(err)
+ return function()
+ return nil, err
+ end
+end
+
+-- chains a sink with a filter
+function sink.chain(f, snk)
+ base.assert(f and snk)
+ return function(chunk, err)
+ if chunk ~= "" then
+ local filtered = f(chunk)
+ local done = chunk and ""
+ while true do
+ local ret, snkerr = snk(filtered, err)
+ if not ret then return nil, snkerr end
+ if filtered == done then return 1 end
+ filtered = f(done)
+ end
+ else return 1 end
+ end
+end
+
+-----------------------------------------------------------------------------
+-- Pump stuff
+-----------------------------------------------------------------------------
+-- pumps one chunk from the source to the sink
+function pump.step(src, snk)
+ local chunk, src_err = src()
+ local ret, snk_err = snk(chunk, src_err)
+ if chunk and ret then return 1
+ else return nil, src_err or snk_err end
+end
+
+-- pumps all data from a source to a sink, using a step function
+function pump.all(src, snk, step)
+ base.assert(src and snk)
+ step = step or pump.step
+ while true do
+ local ret, err = step(src, snk)
+ if not ret then
+ if err then return nil, err
+ else return 1 end
+ end
+ end
+end
+
+return _M
diff --git a/src/luasocket.c b/src/luasocket.c
new file mode 100644
index 0000000..e6ee747
--- /dev/null
+++ b/src/luasocket.c
@@ -0,0 +1,126 @@
+/*=========================================================================*\
+* LuaSocket toolkit
+* Networking support for the Lua language
+* Diego Nehab
+* 26/11/1999
+*
+* This library is part of an effort to progressively increase the network
+* connectivity of the Lua language. The Lua interface to networking
+* functions follows the Sockets API closely, trying to simplify all tasks
+* involved in setting up both client and server connections. The provided
+* IO routines, however, follow the Lua style, being very similar to the
+* standard Lua read and write functions.
+\*=========================================================================*/
+
+/*=========================================================================*\
+* Standard include files
+\*=========================================================================*/
+#include "lua.h"
+#include "lauxlib.h"
+
+
+/*=========================================================================*\
+* LuaSocket includes
+\*=========================================================================*/
+#include "luasocket.h"
+#include "auxiliar.h"
+#include "except.h"
+#include "timeout.h"
+#include "buffer.h"
+#include "inet.h"
+#include "tcp.h"
+#include "udp.h"
+#include "select.h"
+
+/*-------------------------------------------------------------------------*\
+* Internal function prototypes
+\*-------------------------------------------------------------------------*/
+static int global_skip(lua_State *L);
+static int global_unload(lua_State *L);
+static int base_open(lua_State *L);
+
+/*-------------------------------------------------------------------------*\
+* Modules and functions
+\*-------------------------------------------------------------------------*/
+static const luaL_Reg mod[] = {
+ {"auxiliar", auxiliar_open},
+ {"except", except_open},
+ {"timeout", timeout_open},
+ {"buffer", buffer_open},
+ {"inet", inet_open},
+ {"tcp", tcp_open},
+ {"udp", udp_open},
+ {"select", select_open},
+ {NULL, NULL}
+};
+
+static luaL_Reg func[] = {
+ {"skip", global_skip},
+ {"__unload", global_unload},
+ {NULL, NULL}
+};
+
+/*-------------------------------------------------------------------------*\
+* Skip a few arguments
+\*-------------------------------------------------------------------------*/
+static int global_skip(lua_State *L) {
+ int amount = luaL_checkint(L, 1);
+ int ret = lua_gettop(L) - amount - 1;
+ return ret >= 0 ? ret : 0;
+}
+
+/*-------------------------------------------------------------------------*\
+* Unloads the library
+\*-------------------------------------------------------------------------*/
+static int global_unload(lua_State *L) {
+ (void) L;
+ socket_close();
+ return 0;
+}
+
+#if LUA_VERSION_NUM > 501
+int luaL_typerror (lua_State *L, int narg, const char *tname) {
+ const char *msg = lua_pushfstring(L, "%s expected, got %s",
+ tname, luaL_typename(L, narg));
+ return luaL_argerror(L, narg, msg);
+}
+#endif
+
+/*-------------------------------------------------------------------------*\
+* Setup basic stuff.
+\*-------------------------------------------------------------------------*/
+static int base_open(lua_State *L) {
+ if (socket_open()) {
+ /* export functions (and leave namespace table on top of stack) */
+#if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE)
+ lua_newtable(L);
+ luaL_setfuncs(L, func, 0);
+#else
+ luaL_openlib(L, "socket", func, 0);
+#endif
+#ifdef LUASOCKET_DEBUG
+ lua_pushstring(L, "_DEBUG");
+ lua_pushboolean(L, 1);
+ lua_rawset(L, -3);
+#endif
+ /* make version string available to scripts */
+ lua_pushstring(L, "_VERSION");
+ lua_pushstring(L, LUASOCKET_VERSION);
+ lua_rawset(L, -3);
+ return 1;
+ } else {
+ lua_pushstring(L, "unable to initialize library");
+ lua_error(L);
+ return 0;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Initializes all library modules.
+\*-------------------------------------------------------------------------*/
+LUASOCKET_API int luaopen_socket_core(lua_State *L) {
+ int i;
+ base_open(L);
+ for (i = 0; mod[i].name; i++) mod[i].func(L);
+ return 1;
+}
diff --git a/src/luasocket.h b/src/luasocket.h
new file mode 100644
index 0000000..f4463a7
--- /dev/null
+++ b/src/luasocket.h
@@ -0,0 +1,30 @@
+#ifndef LUASOCKET_H
+#define LUASOCKET_H
+/*=========================================================================*\
+* LuaSocket toolkit
+* Networking support for the Lua language
+* Diego Nehab
+* 9/11/1999
+\*=========================================================================*/
+#include "lua.h"
+
+/*-------------------------------------------------------------------------*\
+* Current socket library version
+\*-------------------------------------------------------------------------*/
+#define LUASOCKET_VERSION "LuaSocket 2.1-rc1"
+#define LUASOCKET_COPYRIGHT "Copyright (C) 1999-2012 Diego Nehab"
+#define LUASOCKET_AUTHORS "Diego Nehab"
+
+/*-------------------------------------------------------------------------*\
+* This macro prefixes all exported API functions
+\*-------------------------------------------------------------------------*/
+#ifndef LUASOCKET_API
+#define LUASOCKET_API extern
+#endif
+
+/*-------------------------------------------------------------------------*\
+* Initializes the library.
+\*-------------------------------------------------------------------------*/
+LUASOCKET_API int luaopen_socket_core(lua_State *L);
+
+#endif /* LUASOCKET_H */
diff --git a/src/makefile b/src/makefile
new file mode 100644
index 0000000..f7b0401
--- /dev/null
+++ b/src/makefile
@@ -0,0 +1,372 @@
+# luasocket src/makefile
+#
+# Definitions in this section can be overriden on the command line or in the
+# environment.
+#
+# These are equivalent:
+#
+# export PLAT=linux DEBUG=DEBUG LUAV=5.2 prefix=/sw
+# make
+#
+# and
+#
+# make PLAT=linux DEBUG=DEBUG LUAV=5.2 prefix=/sw
+
+# PLAT: linux macosx win32 mingw
+# platform to build for
+PLAT?=linux
+
+# LUAV: 5.1 5.2
+# lua version to build against
+LUAV?=5.1
+
+# DEBUG: NODEBUG DEBUG
+# debug mode causes luasocket to collect and returns timing information useful
+# for testing and debugging luasocket itself
+DEBUG?=NODEBUG
+
+# COMPAT: COMPAT NOCOMPAT
+# when compiling for 5.2, use LUA_COMPAT_MODULE
+COMPAT?=NOCOMPAT
+
+# where lua headers are found for macosx builds
+# LUAINC_macosx:
+# /opt/local/include
+LUAINC_macosx_base?=/opt/local/include
+LUAINC_macosx?=$(LUAINC_macosx_base)/lua/$(LUAV)
+# FIXME default should this default to fink or to macports?
+# What happens when more than one Lua version is installed?
+LUAPREFIX_macosx?=/opt/local
+CDIR_macosx?=lib/lua/$(LUAV)
+LDIR_macosx?=share/lua/$(LUAV)
+
+
+# LUAINC_linux:
+# /usr/include/lua$(LUAV)
+# /usr/local/include
+# /usr/local/include/lua$(LUAV)
+# where lua headers are found for linux builds
+LUAINC_linux_base?=/usr/include
+LUAINC_linux?=$(LUAINC_linux_base)/lua/$(LUAV)
+LUAPREFIX_linux?=/usr/local
+CDIR_linux?=lib/lua/$(LUAV)
+LDIR_linux?=share/lua/$(LUAV)
+
+# where lua headers are found for mingw builds
+# LUAINC_mingw:
+# /opt/local/include
+LUAINC_mingw_base?=/usr/include
+LUAINC_mingw?=$(LUAINC_mingw_base)/lua/$(LUAV)
+LUALIB_mingw_base?=/usr/bin
+LUALIB_mingw?=$(LUALIB_mingw_base)/lua/$(LUAV)/lua$(subst .,,$(LUAV)).dll
+LUAPREFIX_mingw?=/usr
+CDIR_mingw?=lua/$(LUAV)
+LDIR_mingw?=lua/$(LUAV)/lua
+
+
+# LUAINC_win32:
+# LUALIB_win32:
+# where lua headers and libraries are found for win32 builds
+LUAINC_win32_base?=
+LUAINC_win32?=$(LUAINC_win32_base)/lua/$(LUAV)
+PLATFORM_win32?=Release
+LUAPREFIX_win32?=
+CDIR_win32?=lua/$(LUAV)/$(PLATFORM_win32)
+LDIR_win32?=lua/$(LUAV)/$(PLATFORM_win32)/lua
+LUALIB_win32?=$(LUAPREFIX_win32)/lua/$(LUAV)/$(PLATFORM_win32)
+
+# prefix: /usr/local /usr /opt/local /sw
+# the top of the default install tree
+prefix?=$(LUAPREFIX_$(PLAT))
+
+CDIR?=$(CDIR_$(PLAT))
+LDIR?=$(LDIR_$(PLAT))
+
+# DESTDIR: (no default)
+# used by package managers to install into a temporary destination
+DESTDIR=
+
+#------
+# Definitions below can be overridden on the make command line, but
+# shouldn't have to be.
+
+
+#------
+# Install directories
+#
+
+INSTALL_DIR=install -d
+INSTALL_DATA=install -m644
+INSTALL_EXEC=install
+INSTALL_TOP=$(DESTDIR)$(prefix)
+
+INSTALL_TOP_LDIR=$(INSTALL_TOP)/$(LDIR)
+INSTALL_TOP_CDIR=$(INSTALL_TOP)/$(CDIR)
+
+INSTALL_SOCKET_LDIR=$(INSTALL_TOP_LDIR)/socket
+INSTALL_SOCKET_CDIR=$(INSTALL_TOP_CDIR)/socket
+INSTALL_MIME_LDIR=$(INSTALL_TOP_LDIR)/mime
+INSTALL_MIME_CDIR=$(INSTALL_TOP_CDIR)/mime
+
+print:
+ @echo PLAT=$(PLAT)
+ @echo LUAV=$(LUAV)
+ @echo DEBUG=$(DEBUG)
+ @echo prefix=$(prefix)
+ @echo LUAINC_$(PLAT)=$(LUAINC_$(PLAT))
+ @echo LUALIB_$(PLAT)=$(LUALIB_$(PLAT))
+ @echo INSTALL_TOP_CDIR=$(INSTALL_TOP_CDIR)
+ @echo INSTALL_TOP_LDIR=$(INSTALL_TOP_LDIR)
+
+#------
+# Supported platforms
+#
+PLATS= macosx linux win32 mingw
+
+#------
+# Compiler and linker settings
+# for Mac OS X
+SO_macosx=so
+O_macosx=o
+CC_macosx=gcc
+DEF_macosx= -DLUASOCKET_$(DEBUG) -DUNIX_HAS_SUN_LEN -DLUA_$(COMPAT)_MODULE \
+ -DLUASOCKET_API='__attribute__((visibility("default")))' \
+ -DMIME_API='__attribute__((visibility("default")))'
+CFLAGS_macosx= -I$(LUAINC) $(DEF) -pedantic -Wall -O2 -fno-common \
+ -fvisibility=hidden
+LDFLAGS_macosx= -bundle -undefined dynamic_lookup -o
+LD_macosx= export MACOSX_DEPLOYMENT_TARGET="10.3"; gcc
+SOCKET_macosx=usocket.o
+
+#------
+# Compiler and linker settings
+# for Linux
+SO_linux=so
+O_linux=o
+CC_linux=gcc
+DEF_linux=-DLUASOCKET_$(DEBUG) -DLUA_$(COMPAT)_MODULE \
+ -DLUASOCKET_API='__attribute__((visibility("default")))' \
+ -DMIME_API='__attribute__((visibility("default")))'
+CFLAGS_linux= -I$(LUAINC) $(DEF) -pedantic -Wall -Wshadow -Wextra \
+ -Wimplicit -O2 -ggdb3 -fpic -fvisibility=hidden
+LDFLAGS_linux=-O -shared -fpic -o
+LD_linux=gcc
+SOCKET_linux=usocket.o
+
+#------
+# Compiler and linker settings
+# for MingW
+SO_mingw=dll
+O_mingw=o
+CC_mingw=gcc
+DEF_mingw= -DLUASOCKET_INET_PTON -DLUASOCKET_$(DEBUG) -DLUA_$(COMPAT)_MODULE \
+ -DWINVER=0x0501 -DLUASOCKET_API='__declspec(dllexport)' \
+ -DMIME_API='__declspec(dllexport)'
+CFLAGS_mingw= -I$(LUAINC) $(DEF) -pedantic -Wall -O2 -fno-common \
+ -fvisibility=hidden
+LDFLAGS_mingw= $(LUALIB) -shared -Wl,-s -lws2_32 -o
+LD_mingw=gcc
+SOCKET_mingw=wsocket.o
+
+
+#------
+# Compiler and linker settings
+# for Win32
+SO_win32=dll
+O_win32=obj
+CC_win32=cl
+DEF_win32= //D "WIN32" //D "NDEBUG" //D "_WINDOWS" //D "_USRDLL" \
+ //D "LUASOCKET_API=__declspec(dllexport)" //D "_CRT_SECURE_NO_WARNINGS" \
+ //D "_WINDLL" //D "LUA_$(COMPAT)_MODULE" \
+ //D "MIME_API=__declspec(dllexport)" \
+ //D "LUASOCKET_$(DEBUG)"
+CFLAGS_win32=//I "$(LUAINC)" $(DEF) //O2 //Ot //MD //W3 //nologo
+LDFLAGS_win32= //nologo //link //NOLOGO //DLL //INCREMENTAL:NO \
+ //MANIFEST //MANIFESTFILE:"intermediate.manifest" \
+ //MANIFESTUAC:"level='asInvoker' uiAccess='false'" \
+ //SUBSYSTEM:WINDOWS //OPT:REF //OPT:ICF //DYNAMICBASE:NO \
+ //MACHINE:X86 /LIBPATH:"$(shell cmd //c echo $(LUALIB))" \
+ lua$(subst .,,$(LUAV)).lib ws2_32.lib //OUT:
+LD_win32=cl
+SOCKET_win32=wsocket.obj
+
+.SUFFIXES: .obj
+
+.c.obj:
+ $(CC) $(CFLAGS) //Fo"$@" //c $<
+
+#------
+# Output file names
+#
+SO=$(SO_$(PLAT))
+O=$(O_$(PLAT))
+SOCKET_V=2.1
+MIME_V=1.0.3
+SOCKET_SO=socket.$(SO).$(SOCKET_V)
+MIME_SO=mime.$(SO).$(MIME_V)
+UNIX_SO=unix.$(SO)
+SERIAL_SO=serial.$(SO)
+SOCKET=$(SOCKET_$(PLAT))
+
+#------
+# Settings selected for platform
+#
+CC=$(CC_$(PLAT))
+DEF=$(DEF_$(PLAT))
+CFLAGS=$(CFLAGS_$(PLAT))
+LDFLAGS=$(LDFLAGS_$(PLAT))
+LD=$(LD_$(PLAT))
+LUAINC= $(LUAINC_$(PLAT))
+LUALIB= $(LUALIB_$(PLAT))
+
+#------
+# Modules belonging to socket-core
+#
+SOCKET_OBJS= \
+ luasocket.$(O) \
+ timeout.$(O) \
+ buffer.$(O) \
+ io.$(O) \
+ auxiliar.$(O) \
+ options.$(O) \
+ inet.$(O) \
+ $(SOCKET) \
+ except.$(O) \
+ select.$(O) \
+ tcp.$(O) \
+ udp.$(O)
+
+#------
+# Modules belonging mime-core
+#
+MIME_OBJS= \
+ mime.$(O)
+
+#------
+# Modules belonging unix (local domain sockets)
+#
+UNIX_OBJS=\
+ buffer.$(O) \
+ auxiliar.$(O) \
+ options.$(O) \
+ timeout.$(O) \
+ io.$(O) \
+ usocket.$(O) \
+ unix.$(O)
+
+#------
+# Modules belonging to serial (device streams)
+#
+SERIAL_OBJS:=\
+ buffer.$(O) \
+ auxiliar.$(O) \
+ options.$(O) \
+ timeout.$(O) \
+ io.$(O) \
+ usocket.$(O) \
+ serial.$(O)
+
+#------
+# Files to install
+#
+TO_SOCKET_LDIR= \
+ http.lua \
+ url.lua \
+ tp.lua \
+ ftp.lua \
+ headers.lua \
+ smtp.lua
+
+TO_TOP_LDIR= \
+ ltn12.lua \
+ socket.lua \
+ mime.lua
+
+#------
+# Targets
+#
+default: $(PLAT)
+
+macosx:
+ $(MAKE) all-unix PLAT=macosx
+
+win32:
+ $(MAKE) all PLAT=win32
+
+linux:
+ $(MAKE) all-unix PLAT=linux
+
+mingw:
+ $(MAKE) all PLAT=mingw
+
+none:
+ @echo "Please run"
+ @echo " make PLATFORM"
+ @echo "where PLATFORM is one of these:"
+ @echo " $(PLATS)"
+
+all: $(SOCKET_SO) $(MIME_SO)
+
+$(SOCKET_SO): $(SOCKET_OBJS)
+ $(LD) $(SOCKET_OBJS) $(LDFLAGS)$@
+
+$(MIME_SO): $(MIME_OBJS)
+ $(LD) $(MIME_OBJS) $(LDFLAGS)$@
+
+all-unix: all $(UNIX_SO) $(SERIAL_SO)
+
+$(UNIX_SO): $(UNIX_OBJS)
+ $(LD) $(UNIX_OBJS) $(LDFLAGS)$@
+
+$(SERIAL_SO): $(SERIAL_OBJS)
+ $(LD) $(SERIAL_OBJS) $(LDFLAGS)$@
+
+install:
+ $(INSTALL_DIR) $(INSTALL_TOP_LDIR)
+ $(INSTALL_DATA) $(TO_TOP_LDIR) $(INSTALL_TOP_LDIR)
+ $(INSTALL_DIR) $(INSTALL_SOCKET_LDIR)
+ $(INSTALL_DATA) $(TO_SOCKET_LDIR) $(INSTALL_SOCKET_LDIR)
+ $(INSTALL_DIR) $(INSTALL_SOCKET_CDIR)
+ $(INSTALL_EXEC) $(SOCKET_SO) $(INSTALL_SOCKET_CDIR)/core.$(SO)
+ $(INSTALL_DIR) $(INSTALL_MIME_CDIR)
+ $(INSTALL_EXEC) $(MIME_SO) $(INSTALL_MIME_CDIR)/core.$(SO)
+
+install-unix: install
+ $(INSTALL_EXEC) $(UNIX_SO) $(INSTALL_SOCKET_CDIR)/$(UNIX_SO)
+ $(INSTALL_EXEC) $(SERIAL_SO) $(INSTALL_SOCKET_CDIR)/$(SERIAL_SO)
+
+local:
+ $(MAKE) install INSTALL_TOP_CDIR=.. INSTALL_TOP_LDIR=..
+
+clean:
+ rm -f $(SOCKET_SO) $(SOCKET_OBJS) $(SERIAL_OBJS)
+ rm -f $(MIME_SO) $(UNIX_SO) $(SERIAL_SO) $(MIME_OBJS) $(UNIX_OBJS)
+
+.PHONY: all $(PLATS) default clean echo none
+
+#------
+# List of dependencies
+#
+auxiliar.$(O): auxiliar.c auxiliar.h
+buffer.$(O): buffer.c buffer.h io.h timeout.h
+except.$(O): except.c except.h
+inet.$(O): inet.c inet.h socket.h io.h timeout.h usocket.h
+io.$(O): io.c io.h timeout.h
+luasocket.$(O): luasocket.c luasocket.h auxiliar.h except.h \
+ timeout.h buffer.h io.h inet.h socket.h usocket.h tcp.h \
+ udp.h select.h
+mime.$(O): mime.c mime.h
+options.$(O): options.c auxiliar.h options.h socket.h io.h \
+ timeout.h usocket.h inet.h
+select.$(O): select.c socket.h io.h timeout.h usocket.h select.h
+serial.$(O): serial.c auxiliar.h socket.h io.h timeout.h usocket.h \
+ options.h unix.h buffer.h
+tcp.$(O): tcp.c auxiliar.h socket.h io.h timeout.h usocket.h \
+ inet.h options.h tcp.h buffer.h
+timeout.$(O): timeout.c auxiliar.h timeout.h
+udp.$(O): udp.c auxiliar.h socket.h io.h timeout.h usocket.h \
+ inet.h options.h udp.h
+unix.$(O): unix.c auxiliar.h socket.h io.h timeout.h usocket.h \
+ options.h unix.h buffer.h
+usocket.$(O): usocket.c socket.h io.h timeout.h usocket.h
+wsocket.$(O): wsocket.c socket.h io.h timeout.h usocket.h
diff --git a/src/mbox.lua b/src/mbox.lua
new file mode 100644
index 0000000..7724ae2
--- /dev/null
+++ b/src/mbox.lua
@@ -0,0 +1,92 @@
+local _M = {}
+
+if module then
+ mbox = _M
+end
+
+function _M.split_message(message_s)
+ local message = {}
+ message_s = string.gsub(message_s, "\r\n", "\n")
+ string.gsub(message_s, "^(.-\n)\n", function (h) message.headers = h end)
+ string.gsub(message_s, "^.-\n\n(.*)", function (b) message.body = b end)
+ if not message.body then
+ string.gsub(message_s, "^\n(.*)", function (b) message.body = b end)
+ end
+ if not message.headers and not message.body then
+ message.headers = message_s
+ end
+ return message.headers or "", message.body or ""
+end
+
+function _M.split_headers(headers_s)
+ local headers = {}
+ headers_s = string.gsub(headers_s, "\r\n", "\n")
+ headers_s = string.gsub(headers_s, "\n[ ]+", " ")
+ string.gsub("\n" .. headers_s, "\n([^\n]+)", function (h) table.insert(headers, h) end)
+ return headers
+end
+
+function _M.parse_header(header_s)
+ header_s = string.gsub(header_s, "\n[ ]+", " ")
+ header_s = string.gsub(header_s, "\n+", "")
+ local _, __, name, value = string.find(header_s, "([^%s:]-):%s*(.*)")
+ return name, value
+end
+
+function _M.parse_headers(headers_s)
+ local headers_t = _M.split_headers(headers_s)
+ local headers = {}
+ for i = 1, #headers_t do
+ local name, value = _M.parse_header(headers_t[i])
+ if name then
+ name = string.lower(name)
+ if headers[name] then
+ headers[name] = headers[name] .. ", " .. value
+ else headers[name] = value end
+ end
+ end
+ return headers
+end
+
+function _M.parse_from(from)
+ local _, __, name, address = string.find(from, "^%s*(.-)%s*%<(.-)%>")
+ if not address then
+ _, __, address = string.find(from, "%s*(.+)%s*")
+ end
+ name = name or ""
+ address = address or ""
+ if name == "" then name = address end
+ name = string.gsub(name, '"', "")
+ return name, address
+end
+
+function _M.split_mbox(mbox_s)
+ mbox = {}
+ mbox_s = string.gsub(mbox_s, "\r\n", "\n") .."\n\nFrom \n"
+ local nj, i, j = 1, 1, 1
+ while 1 do
+ i, nj = string.find(mbox_s, "\n\nFrom .-\n", j)
+ if not i then break end
+ local message = string.sub(mbox_s, j, i-1)
+ table.insert(mbox, message)
+ j = nj+1
+ end
+ return mbox
+end
+
+function _M.parse(mbox_s)
+ local mbox = _M.split_mbox(mbox_s)
+ for i = 1, #mbox do
+ mbox[i] = _M.parse_message(mbox[i])
+ end
+ return mbox
+end
+
+function _M.parse_message(message_s)
+ local message = {}
+ message.headers, message.body = _M.split_message(message_s)
+ message.headers = _M.parse_headers(message.headers)
+ return message
+end
+
+return _M
diff --git a/src/mime.c b/src/mime.c
new file mode 100644
index 0000000..dd37dcf
--- /dev/null
+++ b/src/mime.c
@@ -0,0 +1,728 @@
+/*=========================================================================*\
+* MIME support functions
+* LuaSocket toolkit
+\*=========================================================================*/
+#include
+
+#include "lua.h"
+#include "lauxlib.h"
+
+#if !defined(LUA_VERSION_NUM) || (LUA_VERSION_NUM < 501)
+#include "compat-5.1.h"
+#endif
+
+#include "mime.h"
+
+/*=========================================================================*\
+* Don't want to trust escape character constants
+\*=========================================================================*/
+typedef unsigned char UC;
+static const char CRLF[] = "\r\n";
+static const char EQCRLF[] = "=\r\n";
+
+/*=========================================================================*\
+* Internal function prototypes.
+\*=========================================================================*/
+static int mime_global_wrp(lua_State *L);
+static int mime_global_b64(lua_State *L);
+static int mime_global_unb64(lua_State *L);
+static int mime_global_qp(lua_State *L);
+static int mime_global_unqp(lua_State *L);
+static int mime_global_qpwrp(lua_State *L);
+static int mime_global_eol(lua_State *L);
+static int mime_global_dot(lua_State *L);
+
+static size_t dot(int c, size_t state, luaL_Buffer *buffer);
+static void b64setup(UC *base);
+static size_t b64encode(UC c, UC *input, size_t size, luaL_Buffer *buffer);
+static size_t b64pad(const UC *input, size_t size, luaL_Buffer *buffer);
+static size_t b64decode(UC c, UC *input, size_t size, luaL_Buffer *buffer);
+
+static void qpsetup(UC *class, UC *unbase);
+static void qpquote(UC c, luaL_Buffer *buffer);
+static size_t qpdecode(UC c, UC *input, size_t size, luaL_Buffer *buffer);
+static size_t qpencode(UC c, UC *input, size_t size,
+ const char *marker, luaL_Buffer *buffer);
+static size_t qppad(UC *input, size_t size, luaL_Buffer *buffer);
+
+/* code support functions */
+static luaL_Reg func[] = {
+ { "dot", mime_global_dot },
+ { "b64", mime_global_b64 },
+ { "eol", mime_global_eol },
+ { "qp", mime_global_qp },
+ { "qpwrp", mime_global_qpwrp },
+ { "unb64", mime_global_unb64 },
+ { "unqp", mime_global_unqp },
+ { "wrp", mime_global_wrp },
+ { NULL, NULL }
+};
+
+/*-------------------------------------------------------------------------*\
+* Quoted-printable globals
+\*-------------------------------------------------------------------------*/
+static UC qpclass[256];
+static UC qpbase[] = "0123456789ABCDEF";
+static UC qpunbase[256];
+enum {QP_PLAIN, QP_QUOTED, QP_CR, QP_IF_LAST};
+
+/*-------------------------------------------------------------------------*\
+* Base64 globals
+\*-------------------------------------------------------------------------*/
+static const UC b64base[] =
+ "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+static UC b64unbase[256];
+
+/*=========================================================================*\
+* Exported functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Initializes module
+\*-------------------------------------------------------------------------*/
+MIME_API int luaopen_mime_core(lua_State *L)
+{
+#if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE)
+ lua_newtable(L);
+ luaL_setfuncs(L, func, 0);
+#else
+ luaL_openlib(L, "mime", func, 0);
+#endif
+ /* make version string available to scripts */
+ lua_pushstring(L, "_VERSION");
+ lua_pushstring(L, MIME_VERSION);
+ lua_rawset(L, -3);
+ /* initialize lookup tables */
+ qpsetup(qpclass, qpunbase);
+ b64setup(b64unbase);
+ return 1;
+}
+
+/*=========================================================================*\
+* Global Lua functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Incrementaly breaks a string into lines. The string can have CRLF breaks.
+* A, n = wrp(l, B, length)
+* A is a copy of B, broken into lines of at most 'length' bytes.
+* 'l' is how many bytes are left for the first line of B.
+* 'n' is the number of bytes left in the last line of A.
+\*-------------------------------------------------------------------------*/
+static int mime_global_wrp(lua_State *L)
+{
+ size_t size = 0;
+ int left = (int) luaL_checknumber(L, 1);
+ const UC *input = (UC *) luaL_optlstring(L, 2, NULL, &size);
+ const UC *last = input + size;
+ int length = (int) luaL_optnumber(L, 3, 76);
+ luaL_Buffer buffer;
+ /* end of input black-hole */
+ if (!input) {
+ /* if last line has not been terminated, add a line break */
+ if (left < length) lua_pushstring(L, CRLF);
+ /* otherwise, we are done */
+ else lua_pushnil(L);
+ lua_pushnumber(L, length);
+ return 2;
+ }
+ luaL_buffinit(L, &buffer);
+ while (input < last) {
+ switch (*input) {
+ case '\r':
+ break;
+ case '\n':
+ luaL_addstring(&buffer, CRLF);
+ left = length;
+ break;
+ default:
+ if (left <= 0) {
+ left = length;
+ luaL_addstring(&buffer, CRLF);
+ }
+ luaL_addchar(&buffer, *input);
+ left--;
+ break;
+ }
+ input++;
+ }
+ luaL_pushresult(&buffer);
+ lua_pushnumber(L, left);
+ return 2;
+}
+
+/*-------------------------------------------------------------------------*\
+* Fill base64 decode map.
+\*-------------------------------------------------------------------------*/
+static void b64setup(UC *unbase)
+{
+ int i;
+ for (i = 0; i <= 255; i++) unbase[i] = (UC) 255;
+ for (i = 0; i < 64; i++) unbase[b64base[i]] = (UC) i;
+ unbase['='] = 0;
+}
+
+/*-------------------------------------------------------------------------*\
+* Acumulates bytes in input buffer until 3 bytes are available.
+* Translate the 3 bytes into Base64 form and append to buffer.
+* Returns new number of bytes in buffer.
+\*-------------------------------------------------------------------------*/
+static size_t b64encode(UC c, UC *input, size_t size,
+ luaL_Buffer *buffer)
+{
+ input[size++] = c;
+ if (size == 3) {
+ UC code[4];
+ unsigned long value = 0;
+ value += input[0]; value <<= 8;
+ value += input[1]; value <<= 8;
+ value += input[2];
+ code[3] = b64base[value & 0x3f]; value >>= 6;
+ code[2] = b64base[value & 0x3f]; value >>= 6;
+ code[1] = b64base[value & 0x3f]; value >>= 6;
+ code[0] = b64base[value];
+ luaL_addlstring(buffer, (char *) code, 4);
+ size = 0;
+ }
+ return size;
+}
+
+/*-------------------------------------------------------------------------*\
+* Encodes the Base64 last 1 or 2 bytes and adds padding '='
+* Result, if any, is appended to buffer.
+* Returns 0.
+\*-------------------------------------------------------------------------*/
+static size_t b64pad(const UC *input, size_t size,
+ luaL_Buffer *buffer)
+{
+ unsigned long value = 0;
+ UC code[4] = {'=', '=', '=', '='};
+ switch (size) {
+ case 1:
+ value = input[0] << 4;
+ code[1] = b64base[value & 0x3f]; value >>= 6;
+ code[0] = b64base[value];
+ luaL_addlstring(buffer, (char *) code, 4);
+ break;
+ case 2:
+ value = input[0]; value <<= 8;
+ value |= input[1]; value <<= 2;
+ code[2] = b64base[value & 0x3f]; value >>= 6;
+ code[1] = b64base[value & 0x3f]; value >>= 6;
+ code[0] = b64base[value];
+ luaL_addlstring(buffer, (char *) code, 4);
+ break;
+ default:
+ break;
+ }
+ return 0;
+}
+
+/*-------------------------------------------------------------------------*\
+* Acumulates bytes in input buffer until 4 bytes are available.
+* Translate the 4 bytes from Base64 form and append to buffer.
+* Returns new number of bytes in buffer.
+\*-------------------------------------------------------------------------*/
+static size_t b64decode(UC c, UC *input, size_t size,
+ luaL_Buffer *buffer)
+{
+ /* ignore invalid characters */
+ if (b64unbase[c] > 64) return size;
+ input[size++] = c;
+ /* decode atom */
+ if (size == 4) {
+ UC decoded[3];
+ int valid, value = 0;
+ value = b64unbase[input[0]]; value <<= 6;
+ value |= b64unbase[input[1]]; value <<= 6;
+ value |= b64unbase[input[2]]; value <<= 6;
+ value |= b64unbase[input[3]];
+ decoded[2] = (UC) (value & 0xff); value >>= 8;
+ decoded[1] = (UC) (value & 0xff); value >>= 8;
+ decoded[0] = (UC) value;
+ /* take care of paddding */
+ valid = (input[2] == '=') ? 1 : (input[3] == '=') ? 2 : 3;
+ luaL_addlstring(buffer, (char *) decoded, valid);
+ return 0;
+ /* need more data */
+ } else return size;
+}
+
+/*-------------------------------------------------------------------------*\
+* Incrementally applies the Base64 transfer content encoding to a string
+* A, B = b64(C, D)
+* A is the encoded version of the largest prefix of C .. D that is
+* divisible by 3. B has the remaining bytes of C .. D, *without* encoding.
+* The easiest thing would be to concatenate the two strings and
+* encode the result, but we can't afford that or Lua would dupplicate
+* every chunk we received.
+\*-------------------------------------------------------------------------*/
+static int mime_global_b64(lua_State *L)
+{
+ UC atom[3];
+ size_t isize = 0, asize = 0;
+ const UC *input = (UC *) luaL_optlstring(L, 1, NULL, &isize);
+ const UC *last = input + isize;
+ luaL_Buffer buffer;
+ /* end-of-input blackhole */
+ if (!input) {
+ lua_pushnil(L);
+ lua_pushnil(L);
+ return 2;
+ }
+ /* make sure we don't confuse buffer stuff with arguments */
+ lua_settop(L, 2);
+ /* process first part of the input */
+ luaL_buffinit(L, &buffer);
+ while (input < last)
+ asize = b64encode(*input++, atom, asize, &buffer);
+ input = (UC *) luaL_optlstring(L, 2, NULL, &isize);
+ /* if second part is nil, we are done */
+ if (!input) {
+ size_t osize = 0;
+ asize = b64pad(atom, asize, &buffer);
+ luaL_pushresult(&buffer);
+ /* if the output is empty and the input is nil, return nil */
+ lua_tolstring(L, -1, &osize);
+ if (osize == 0) lua_pushnil(L);
+ lua_pushnil(L);
+ return 2;
+ }
+ /* otherwise process the second part */
+ last = input + isize;
+ while (input < last)
+ asize = b64encode(*input++, atom, asize, &buffer);
+ luaL_pushresult(&buffer);
+ lua_pushlstring(L, (char *) atom, asize);
+ return 2;
+}
+
+/*-------------------------------------------------------------------------*\
+* Incrementally removes the Base64 transfer content encoding from a string
+* A, B = b64(C, D)
+* A is the encoded version of the largest prefix of C .. D that is
+* divisible by 4. B has the remaining bytes of C .. D, *without* encoding.
+\*-------------------------------------------------------------------------*/
+static int mime_global_unb64(lua_State *L)
+{
+ UC atom[4];
+ size_t isize = 0, asize = 0;
+ const UC *input = (UC *) luaL_optlstring(L, 1, NULL, &isize);
+ const UC *last = input + isize;
+ luaL_Buffer buffer;
+ /* end-of-input blackhole */
+ if (!input) {
+ lua_pushnil(L);
+ lua_pushnil(L);
+ return 2;
+ }
+ /* make sure we don't confuse buffer stuff with arguments */
+ lua_settop(L, 2);
+ /* process first part of the input */
+ luaL_buffinit(L, &buffer);
+ while (input < last)
+ asize = b64decode(*input++, atom, asize, &buffer);
+ input = (UC *) luaL_optlstring(L, 2, NULL, &isize);
+ /* if second is nil, we are done */
+ if (!input) {
+ size_t osize = 0;
+ luaL_pushresult(&buffer);
+ /* if the output is empty and the input is nil, return nil */
+ lua_tolstring(L, -1, &osize);
+ if (osize == 0) lua_pushnil(L);
+ lua_pushnil(L);
+ return 2;
+ }
+ /* otherwise, process the rest of the input */
+ last = input + isize;
+ while (input < last)
+ asize = b64decode(*input++, atom, asize, &buffer);
+ luaL_pushresult(&buffer);
+ lua_pushlstring(L, (char *) atom, asize);
+ return 2;
+}
+
+/*-------------------------------------------------------------------------*\
+* Quoted-printable encoding scheme
+* all (except CRLF in text) can be =XX
+* CLRL in not text must be =XX=XX
+* 33 through 60 inclusive can be plain
+* 62 through 126 inclusive can be plain
+* 9 and 32 can be plain, unless in the end of a line, where must be =XX
+* encoded lines must be no longer than 76 not counting CRLF
+* soft line-break are =CRLF
+* To encode one byte, we need to see the next two.
+* Worst case is when we see a space, and wonder if a CRLF is comming
+\*-------------------------------------------------------------------------*/
+/*-------------------------------------------------------------------------*\
+* Split quoted-printable characters into classes
+* Precompute reverse map for encoding
+\*-------------------------------------------------------------------------*/
+static void qpsetup(UC *cl, UC *unbase)
+{
+ int i;
+ for (i = 0; i < 256; i++) cl[i] = QP_QUOTED;
+ for (i = 33; i <= 60; i++) cl[i] = QP_PLAIN;
+ for (i = 62; i <= 126; i++) cl[i] = QP_PLAIN;
+ cl['\t'] = QP_IF_LAST;
+ cl[' '] = QP_IF_LAST;
+ cl['\r'] = QP_CR;
+ for (i = 0; i < 256; i++) unbase[i] = 255;
+ unbase['0'] = 0; unbase['1'] = 1; unbase['2'] = 2;
+ unbase['3'] = 3; unbase['4'] = 4; unbase['5'] = 5;
+ unbase['6'] = 6; unbase['7'] = 7; unbase['8'] = 8;
+ unbase['9'] = 9; unbase['A'] = 10; unbase['a'] = 10;
+ unbase['B'] = 11; unbase['b'] = 11; unbase['C'] = 12;
+ unbase['c'] = 12; unbase['D'] = 13; unbase['d'] = 13;
+ unbase['E'] = 14; unbase['e'] = 14; unbase['F'] = 15;
+ unbase['f'] = 15;
+}
+
+/*-------------------------------------------------------------------------*\
+* Output one character in form =XX
+\*-------------------------------------------------------------------------*/
+static void qpquote(UC c, luaL_Buffer *buffer)
+{
+ luaL_addchar(buffer, '=');
+ luaL_addchar(buffer, qpbase[c >> 4]);
+ luaL_addchar(buffer, qpbase[c & 0x0F]);
+}
+
+/*-------------------------------------------------------------------------*\
+* Accumulate characters until we are sure about how to deal with them.
+* Once we are sure, output to the buffer, in the correct form.
+\*-------------------------------------------------------------------------*/
+static size_t qpencode(UC c, UC *input, size_t size,
+ const char *marker, luaL_Buffer *buffer)
+{
+ input[size++] = c;
+ /* deal with all characters we can have */
+ while (size > 0) {
+ switch (qpclass[input[0]]) {
+ /* might be the CR of a CRLF sequence */
+ case QP_CR:
+ if (size < 2) return size;
+ if (input[1] == '\n') {
+ luaL_addstring(buffer, marker);
+ return 0;
+ } else qpquote(input[0], buffer);
+ break;
+ /* might be a space and that has to be quoted if last in line */
+ case QP_IF_LAST:
+ if (size < 3) return size;
+ /* if it is the last, quote it and we are done */
+ if (input[1] == '\r' && input[2] == '\n') {
+ qpquote(input[0], buffer);
+ luaL_addstring(buffer, marker);
+ return 0;
+ } else luaL_addchar(buffer, input[0]);
+ break;
+ /* might have to be quoted always */
+ case QP_QUOTED:
+ qpquote(input[0], buffer);
+ break;
+ /* might never have to be quoted */
+ default:
+ luaL_addchar(buffer, input[0]);
+ break;
+ }
+ input[0] = input[1]; input[1] = input[2];
+ size--;
+ }
+ return 0;
+}
+
+/*-------------------------------------------------------------------------*\
+* Deal with the final characters
+\*-------------------------------------------------------------------------*/
+static size_t qppad(UC *input, size_t size, luaL_Buffer *buffer)
+{
+ size_t i;
+ for (i = 0; i < size; i++) {
+ if (qpclass[input[i]] == QP_PLAIN) luaL_addchar(buffer, input[i]);
+ else qpquote(input[i], buffer);
+ }
+ if (size > 0) luaL_addstring(buffer, EQCRLF);
+ return 0;
+}
+
+/*-------------------------------------------------------------------------*\
+* Incrementally converts a string to quoted-printable
+* A, B = qp(C, D, marker)
+* Marker is the text to be used to replace CRLF sequences found in A.
+* A is the encoded version of the largest prefix of C .. D that
+* can be encoded without doubts.
+* B has the remaining bytes of C .. D, *without* encoding.
+\*-------------------------------------------------------------------------*/
+static int mime_global_qp(lua_State *L)
+{
+
+ size_t asize = 0, isize = 0;
+ UC atom[3];
+ const UC *input = (UC *) luaL_optlstring(L, 1, NULL, &isize);
+ const UC *last = input + isize;
+ const char *marker = luaL_optstring(L, 3, CRLF);
+ luaL_Buffer buffer;
+ /* end-of-input blackhole */
+ if (!input) {
+ lua_pushnil(L);
+ lua_pushnil(L);
+ return 2;
+ }
+ /* make sure we don't confuse buffer stuff with arguments */
+ lua_settop(L, 3);
+ /* process first part of input */
+ luaL_buffinit(L, &buffer);
+ while (input < last)
+ asize = qpencode(*input++, atom, asize, marker, &buffer);
+ input = (UC *) luaL_optlstring(L, 2, NULL, &isize);
+ /* if second part is nil, we are done */
+ if (!input) {
+ asize = qppad(atom, asize, &buffer);
+ luaL_pushresult(&buffer);
+ if (!(*lua_tostring(L, -1))) lua_pushnil(L);
+ lua_pushnil(L);
+ return 2;
+ }
+ /* otherwise process rest of input */
+ last = input + isize;
+ while (input < last)
+ asize = qpencode(*input++, atom, asize, marker, &buffer);
+ luaL_pushresult(&buffer);
+ lua_pushlstring(L, (char *) atom, asize);
+ return 2;
+}
+
+/*-------------------------------------------------------------------------*\
+* Accumulate characters until we are sure about how to deal with them.
+* Once we are sure, output the to the buffer, in the correct form.
+\*-------------------------------------------------------------------------*/
+static size_t qpdecode(UC c, UC *input, size_t size, luaL_Buffer *buffer) {
+ int d;
+ input[size++] = c;
+ /* deal with all characters we can deal */
+ switch (input[0]) {
+ /* if we have an escape character */
+ case '=':
+ if (size < 3) return size;
+ /* eliminate soft line break */
+ if (input[1] == '\r' && input[2] == '\n') return 0;
+ /* decode quoted representation */
+ c = qpunbase[input[1]]; d = qpunbase[input[2]];
+ /* if it is an invalid, do not decode */
+ if (c > 15 || d > 15) luaL_addlstring(buffer, (char *)input, 3);
+ else luaL_addchar(buffer, (char) ((c << 4) + d));
+ return 0;
+ case '\r':
+ if (size < 2) return size;
+ if (input[1] == '\n') luaL_addlstring(buffer, (char *)input, 2);
+ return 0;
+ default:
+ if (input[0] == '\t' || (input[0] > 31 && input[0] < 127))
+ luaL_addchar(buffer, input[0]);
+ return 0;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Incrementally decodes a string in quoted-printable
+* A, B = qp(C, D)
+* A is the decoded version of the largest prefix of C .. D that
+* can be decoded without doubts.
+* B has the remaining bytes of C .. D, *without* decoding.
+\*-------------------------------------------------------------------------*/
+static int mime_global_unqp(lua_State *L)
+{
+ size_t asize = 0, isize = 0;
+ UC atom[3];
+ const UC *input = (UC *) luaL_optlstring(L, 1, NULL, &isize);
+ const UC *last = input + isize;
+ luaL_Buffer buffer;
+ /* end-of-input blackhole */
+ if (!input) {
+ lua_pushnil(L);
+ lua_pushnil(L);
+ return 2;
+ }
+ /* make sure we don't confuse buffer stuff with arguments */
+ lua_settop(L, 2);
+ /* process first part of input */
+ luaL_buffinit(L, &buffer);
+ while (input < last)
+ asize = qpdecode(*input++, atom, asize, &buffer);
+ input = (UC *) luaL_optlstring(L, 2, NULL, &isize);
+ /* if second part is nil, we are done */
+ if (!input) {
+ luaL_pushresult(&buffer);
+ if (!(*lua_tostring(L, -1))) lua_pushnil(L);
+ lua_pushnil(L);
+ return 2;
+ }
+ /* otherwise process rest of input */
+ last = input + isize;
+ while (input < last)
+ asize = qpdecode(*input++, atom, asize, &buffer);
+ luaL_pushresult(&buffer);
+ lua_pushlstring(L, (char *) atom, asize);
+ return 2;
+}
+
+/*-------------------------------------------------------------------------*\
+* Incrementally breaks a quoted-printed string into lines
+* A, n = qpwrp(l, B, length)
+* A is a copy of B, broken into lines of at most 'length' bytes.
+* 'l' is how many bytes are left for the first line of B.
+* 'n' is the number of bytes left in the last line of A.
+* There are two complications: lines can't be broken in the middle
+* of an encoded =XX, and there might be line breaks already
+\*-------------------------------------------------------------------------*/
+static int mime_global_qpwrp(lua_State *L)
+{
+ size_t size = 0;
+ int left = (int) luaL_checknumber(L, 1);
+ const UC *input = (UC *) luaL_optlstring(L, 2, NULL, &size);
+ const UC *last = input + size;
+ int length = (int) luaL_optnumber(L, 3, 76);
+ luaL_Buffer buffer;
+ /* end-of-input blackhole */
+ if (!input) {
+ if (left < length) lua_pushstring(L, EQCRLF);
+ else lua_pushnil(L);
+ lua_pushnumber(L, length);
+ return 2;
+ }
+ /* process all input */
+ luaL_buffinit(L, &buffer);
+ while (input < last) {
+ switch (*input) {
+ case '\r':
+ break;
+ case '\n':
+ left = length;
+ luaL_addstring(&buffer, CRLF);
+ break;
+ case '=':
+ if (left <= 3) {
+ left = length;
+ luaL_addstring(&buffer, EQCRLF);
+ }
+ luaL_addchar(&buffer, *input);
+ left--;
+ break;
+ default:
+ if (left <= 1) {
+ left = length;
+ luaL_addstring(&buffer, EQCRLF);
+ }
+ luaL_addchar(&buffer, *input);
+ left--;
+ break;
+ }
+ input++;
+ }
+ luaL_pushresult(&buffer);
+ lua_pushnumber(L, left);
+ return 2;
+}
+
+/*-------------------------------------------------------------------------*\
+* Here is what we do: \n, and \r are considered candidates for line
+* break. We issue *one* new line marker if any of them is seen alone, or
+* followed by a different one. That is, \n\n and \r\r will issue two
+* end of line markers each, but \r\n, \n\r etc will only issue *one*
+* marker. This covers Mac OS, Mac OS X, VMS, Unix and DOS, as well as
+* probably other more obscure conventions.
+*
+* c is the current character being processed
+* last is the previous character
+\*-------------------------------------------------------------------------*/
+#define eolcandidate(c) (c == '\r' || c == '\n')
+static int eolprocess(int c, int last, const char *marker,
+ luaL_Buffer *buffer)
+{
+ if (eolcandidate(c)) {
+ if (eolcandidate(last)) {
+ if (c == last) luaL_addstring(buffer, marker);
+ return 0;
+ } else {
+ luaL_addstring(buffer, marker);
+ return c;
+ }
+ } else {
+ luaL_addchar(buffer, (char) c);
+ return 0;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Converts a string to uniform EOL convention.
+* A, n = eol(o, B, marker)
+* A is the converted version of the largest prefix of B that can be
+* converted unambiguously. 'o' is the context returned by the previous
+* call. 'n' is the new context.
+\*-------------------------------------------------------------------------*/
+static int mime_global_eol(lua_State *L)
+{
+ int ctx = luaL_checkint(L, 1);
+ size_t isize = 0;
+ const char *input = luaL_optlstring(L, 2, NULL, &isize);
+ const char *last = input + isize;
+ const char *marker = luaL_optstring(L, 3, CRLF);
+ luaL_Buffer buffer;
+ luaL_buffinit(L, &buffer);
+ /* end of input blackhole */
+ if (!input) {
+ lua_pushnil(L);
+ lua_pushnumber(L, 0);
+ return 2;
+ }
+ /* process all input */
+ while (input < last)
+ ctx = eolprocess(*input++, ctx, marker, &buffer);
+ luaL_pushresult(&buffer);
+ lua_pushnumber(L, ctx);
+ return 2;
+}
+
+/*-------------------------------------------------------------------------*\
+* Takes one byte and stuff it if needed.
+\*-------------------------------------------------------------------------*/
+static size_t dot(int c, size_t state, luaL_Buffer *buffer)
+{
+ luaL_addchar(buffer, (char) c);
+ switch (c) {
+ case '\r':
+ return 1;
+ case '\n':
+ return (state == 1)? 2: 0;
+ case '.':
+ if (state == 2)
+ luaL_addchar(buffer, '.');
+ default:
+ return 0;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Incrementally applies smtp stuffing to a string
+* A, n = dot(l, D)
+\*-------------------------------------------------------------------------*/
+static int mime_global_dot(lua_State *L)
+{
+ size_t isize = 0, state = (size_t) luaL_checknumber(L, 1);
+ const char *input = luaL_optlstring(L, 2, NULL, &isize);
+ const char *last = input + isize;
+ luaL_Buffer buffer;
+ /* end-of-input blackhole */
+ if (!input) {
+ lua_pushnil(L);
+ lua_pushnumber(L, 2);
+ return 2;
+ }
+ /* process all input */
+ luaL_buffinit(L, &buffer);
+ while (input < last)
+ state = dot(*input++, state, &buffer);
+ luaL_pushresult(&buffer);
+ lua_pushnumber(L, (lua_Number) state);
+ return 2;
+}
+
diff --git a/src/mime.h b/src/mime.h
new file mode 100644
index 0000000..150e7ad
--- /dev/null
+++ b/src/mime.h
@@ -0,0 +1,29 @@
+#ifndef MIME_H
+#define MIME_H
+/*=========================================================================*\
+* Core MIME support
+* LuaSocket toolkit
+*
+* This module provides functions to implement transfer content encodings
+* and formatting conforming to RFC 2045. It is used by mime.lua, which
+* provide a higher level interface to this functionality.
+\*=========================================================================*/
+#include "lua.h"
+
+/*-------------------------------------------------------------------------*\
+* Current MIME library version
+\*-------------------------------------------------------------------------*/
+#define MIME_VERSION "MIME 1.0.3-rc1"
+#define MIME_COPYRIGHT "Copyright (C) 2004-2012 Diego Nehab"
+#define MIME_AUTHORS "Diego Nehab"
+
+/*-------------------------------------------------------------------------*\
+* This macro prefixes all exported API functions
+\*-------------------------------------------------------------------------*/
+#ifndef MIME_API
+#define MIME_API extern
+#endif
+
+MIME_API int luaopen_mime_core(lua_State *L);
+
+#endif /* MIME_H */
diff --git a/src/mime.lua b/src/mime.lua
new file mode 100644
index 0000000..642cd9c
--- /dev/null
+++ b/src/mime.lua
@@ -0,0 +1,90 @@
+-----------------------------------------------------------------------------
+-- MIME support for the Lua language.
+-- Author: Diego Nehab
+-- Conforming to RFCs 2045-2049
+-----------------------------------------------------------------------------
+
+-----------------------------------------------------------------------------
+-- Declare module and import dependencies
+-----------------------------------------------------------------------------
+local base = _G
+local ltn12 = require("ltn12")
+local mime = require("mime.core")
+local io = require("io")
+local string = require("string")
+local _M = mime
+
+-- encode, decode and wrap algorithm tables
+local encodet, decodet, wrapt = {},{},{}
+
+_M.encodet = encodet
+_M.decodet = decodet
+_M.wrapt = wrapt
+
+-- creates a function that chooses a filter by name from a given table
+local function choose(table)
+ return function(name, opt1, opt2)
+ if base.type(name) ~= "string" then
+ name, opt1, opt2 = "default", name, opt1
+ end
+ local f = table[name or "nil"]
+ if not f then
+ base.error("unknown key (" .. base.tostring(name) .. ")", 3)
+ else return f(opt1, opt2) end
+ end
+end
+
+-- define the encoding filters
+encodet['base64'] = function()
+ return ltn12.filter.cycle(_M.b64, "")
+end
+
+encodet['quoted-printable'] = function(mode)
+ return ltn12.filter.cycle(_M.qp, "",
+ (mode == "binary") and "=0D=0A" or "\r\n")
+end
+
+-- define the decoding filters
+decodet['base64'] = function()
+ return ltn12.filter.cycle(_M.unb64, "")
+end
+
+decodet['quoted-printable'] = function()
+ return ltn12.filter.cycle(_M.unqp, "")
+end
+
+local function format(chunk)
+ if chunk then
+ if chunk == "" then return "''"
+ else return string.len(chunk) end
+ else return "nil" end
+end
+
+-- define the line-wrap filters
+wrapt['text'] = function(length)
+ length = length or 76
+ return ltn12.filter.cycle(_M.wrp, length, length)
+end
+wrapt['base64'] = wrapt['text']
+wrapt['default'] = wrapt['text']
+
+wrapt['quoted-printable'] = function()
+ return ltn12.filter.cycle(_M.qpwrp, 76, 76)
+end
+
+-- function that choose the encoding, decoding or wrap algorithm
+_M.encode = choose(encodet)
+_M.decode = choose(decodet)
+_M.wrap = choose(wrapt)
+
+-- define the end-of-line normalization filter
+function _M.normalize(marker)
+ return ltn12.filter.cycle(_M.eol, 0, marker)
+end
+
+-- high level stuffing filter
+function _M.stuff()
+ return ltn12.filter.cycle(_M.dot, 2)
+end
+
+return _M
\ No newline at end of file
diff --git a/src/options.c b/src/options.c
new file mode 100644
index 0000000..8ac2a14
--- /dev/null
+++ b/src/options.c
@@ -0,0 +1,364 @@
+/*=========================================================================*\
+* Common option interface
+* LuaSocket toolkit
+\*=========================================================================*/
+#include
+
+#include "lauxlib.h"
+
+#include "auxiliar.h"
+#include "options.h"
+#include "inet.h"
+
+
+/*=========================================================================*\
+* Internal functions prototypes
+\*=========================================================================*/
+static int opt_setmembership(lua_State *L, p_socket ps, int level, int name);
+static int opt_ip6_setmembership(lua_State *L, p_socket ps, int level, int name);
+static int opt_setboolean(lua_State *L, p_socket ps, int level, int name);
+static int opt_getboolean(lua_State *L, p_socket ps, int level, int name);
+static int opt_setint(lua_State *L, p_socket ps, int level, int name);
+static int opt_getint(lua_State *L, p_socket ps, int level, int name);
+static int opt_set(lua_State *L, p_socket ps, int level, int name,
+ void *val, int len);
+static int opt_get(lua_State *L, p_socket ps, int level, int name,
+ void *val, int* len);
+
+/*=========================================================================*\
+* Exported functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Calls appropriate option handler
+\*-------------------------------------------------------------------------*/
+int opt_meth_setoption(lua_State *L, p_opt opt, p_socket ps)
+{
+ const char *name = luaL_checkstring(L, 2); /* obj, name, ... */
+ while (opt->name && strcmp(name, opt->name))
+ opt++;
+ if (!opt->func) {
+ char msg[45];
+ sprintf(msg, "unsupported option `%.35s'", name);
+ luaL_argerror(L, 2, msg);
+ }
+ return opt->func(L, ps);
+}
+
+int opt_meth_getoption(lua_State *L, p_opt opt, p_socket ps)
+{
+ const char *name = luaL_checkstring(L, 2); /* obj, name, ... */
+ while (opt->name && strcmp(name, opt->name))
+ opt++;
+ if (!opt->func) {
+ char msg[45];
+ sprintf(msg, "unsupported option `%.35s'", name);
+ luaL_argerror(L, 2, msg);
+ }
+ return opt->func(L, ps);
+}
+
+/* enables reuse of local address */
+int opt_set_reuseaddr(lua_State *L, p_socket ps)
+{
+ return opt_setboolean(L, ps, SOL_SOCKET, SO_REUSEADDR);
+}
+
+int opt_get_reuseaddr(lua_State *L, p_socket ps)
+{
+ return opt_getboolean(L, ps, SOL_SOCKET, SO_REUSEADDR);
+}
+
+/* enables reuse of local port */
+int opt_set_reuseport(lua_State *L, p_socket ps)
+{
+ return opt_setboolean(L, ps, SOL_SOCKET, SO_REUSEPORT);
+}
+
+int opt_get_reuseport(lua_State *L, p_socket ps)
+{
+ return opt_getboolean(L, ps, SOL_SOCKET, SO_REUSEPORT);
+}
+
+/* disables the Naggle algorithm */
+int opt_set_tcp_nodelay(lua_State *L, p_socket ps)
+{
+ return opt_setboolean(L, ps, IPPROTO_TCP, TCP_NODELAY);
+}
+
+int opt_get_tcp_nodelay(lua_State *L, p_socket ps)
+{
+ return opt_getboolean(L, ps, IPPROTO_TCP, TCP_NODELAY);
+}
+
+int opt_set_keepalive(lua_State *L, p_socket ps)
+{
+ return opt_setboolean(L, ps, SOL_SOCKET, SO_KEEPALIVE);
+}
+
+int opt_get_keepalive(lua_State *L, p_socket ps)
+{
+ return opt_getboolean(L, ps, SOL_SOCKET, SO_KEEPALIVE);
+}
+
+int opt_set_dontroute(lua_State *L, p_socket ps)
+{
+ return opt_setboolean(L, ps, SOL_SOCKET, SO_DONTROUTE);
+}
+
+int opt_set_broadcast(lua_State *L, p_socket ps)
+{
+ return opt_setboolean(L, ps, SOL_SOCKET, SO_BROADCAST);
+}
+
+int opt_set_ip6_unicast_hops(lua_State *L, p_socket ps)
+{
+ return opt_setint(L, ps, IPPROTO_IPV6, IPV6_UNICAST_HOPS);
+}
+
+int opt_get_ip6_unicast_hops(lua_State *L, p_socket ps)
+{
+ return opt_getint(L, ps, IPPROTO_IPV6, IPV6_UNICAST_HOPS);
+}
+
+int opt_set_ip6_multicast_hops(lua_State *L, p_socket ps)
+{
+ return opt_setint(L, ps, IPPROTO_IPV6, IPV6_MULTICAST_HOPS);
+}
+
+int opt_get_ip6_multicast_hops(lua_State *L, p_socket ps)
+{
+ return opt_getint(L, ps, IPPROTO_IPV6, IPV6_MULTICAST_HOPS);
+}
+
+int opt_set_ip_multicast_loop(lua_State *L, p_socket ps)
+{
+ return opt_setboolean(L, ps, IPPROTO_IP, IP_MULTICAST_LOOP);
+}
+
+int opt_get_ip_multicast_loop(lua_State *L, p_socket ps)
+{
+ return opt_getboolean(L, ps, IPPROTO_IP, IP_MULTICAST_LOOP);
+}
+
+int opt_set_ip6_multicast_loop(lua_State *L, p_socket ps)
+{
+ return opt_setboolean(L, ps, IPPROTO_IPV6, IPV6_MULTICAST_LOOP);
+}
+
+int opt_get_ip6_multicast_loop(lua_State *L, p_socket ps)
+{
+ return opt_getboolean(L, ps, IPPROTO_IPV6, IPV6_MULTICAST_LOOP);
+}
+
+int opt_set_linger(lua_State *L, p_socket ps)
+{
+ struct linger li; /* obj, name, table */
+ if (!lua_istable(L, 3)) auxiliar_typeerror(L,3,lua_typename(L, LUA_TTABLE));
+ lua_pushstring(L, "on");
+ lua_gettable(L, 3);
+ if (!lua_isboolean(L, -1))
+ luaL_argerror(L, 3, "boolean 'on' field expected");
+ li.l_onoff = (u_short) lua_toboolean(L, -1);
+ lua_pushstring(L, "timeout");
+ lua_gettable(L, 3);
+ if (!lua_isnumber(L, -1))
+ luaL_argerror(L, 3, "number 'timeout' field expected");
+ li.l_linger = (u_short) lua_tonumber(L, -1);
+ return opt_set(L, ps, SOL_SOCKET, SO_LINGER, (char *) &li, sizeof(li));
+}
+
+int opt_get_linger(lua_State *L, p_socket ps)
+{
+ struct linger li; /* obj, name */
+ int len = sizeof(li);
+ int err = opt_get(L, ps, SOL_SOCKET, SO_LINGER, (char *) &li, &len);
+ if (err)
+ return err;
+ lua_newtable(L);
+ lua_pushboolean(L, li.l_onoff);
+ lua_setfield(L, -2, "on");
+ lua_pushinteger(L, li.l_linger);
+ lua_setfield(L, -2, "timeout");
+ return 1;
+}
+
+int opt_set_ip_multicast_ttl(lua_State *L, p_socket ps)
+{
+ return opt_setint(L, ps, IPPROTO_IP, IP_MULTICAST_TTL);
+}
+
+int opt_set_ip_multicast_if(lua_State *L, p_socket ps)
+{
+ const char *address = luaL_checkstring(L, 3); /* obj, name, ip */
+ struct in_addr val;
+ val.s_addr = htonl(INADDR_ANY);
+ if (strcmp(address, "*") && !inet_aton(address, &val))
+ luaL_argerror(L, 3, "ip expected");
+ return opt_set(L, ps, IPPROTO_IP, IP_MULTICAST_IF,
+ (char *) &val, sizeof(val));
+}
+
+int opt_get_ip_multicast_if(lua_State *L, p_socket ps)
+{
+ struct in_addr val;
+ socklen_t len = sizeof(val);
+ if (getsockopt(*ps, IPPROTO_IP, IP_MULTICAST_IF, (char *) &val, &len) < 0) {
+ lua_pushnil(L);
+ lua_pushstring(L, "getsockopt failed");
+ return 2;
+ }
+ lua_pushstring(L, inet_ntoa(val));
+ return 1;
+}
+
+int opt_set_ip_add_membership(lua_State *L, p_socket ps)
+{
+ return opt_setmembership(L, ps, IPPROTO_IP, IP_ADD_MEMBERSHIP);
+}
+
+int opt_set_ip_drop_membersip(lua_State *L, p_socket ps)
+{
+ return opt_setmembership(L, ps, IPPROTO_IP, IP_DROP_MEMBERSHIP);
+}
+
+int opt_set_ip6_add_membership(lua_State *L, p_socket ps)
+{
+ return opt_ip6_setmembership(L, ps, IPPROTO_IPV6, IPV6_ADD_MEMBERSHIP);
+}
+
+int opt_set_ip6_drop_membersip(lua_State *L, p_socket ps)
+{
+ return opt_ip6_setmembership(L, ps, IPPROTO_IPV6, IPV6_DROP_MEMBERSHIP);
+}
+
+int opt_get_ip6_v6only(lua_State *L, p_socket ps)
+{
+ return opt_getboolean(L, ps, IPPROTO_IPV6, IPV6_V6ONLY);
+}
+
+int opt_set_ip6_v6only(lua_State *L, p_socket ps)
+{
+ return opt_setboolean(L, ps, IPPROTO_IPV6, IPV6_V6ONLY);
+}
+
+/*=========================================================================*\
+* Auxiliar functions
+\*=========================================================================*/
+static int opt_setmembership(lua_State *L, p_socket ps, int level, int name)
+{
+ struct ip_mreq val; /* obj, name, table */
+ if (!lua_istable(L, 3)) auxiliar_typeerror(L,3,lua_typename(L, LUA_TTABLE));
+ lua_pushstring(L, "multiaddr");
+ lua_gettable(L, 3);
+ if (!lua_isstring(L, -1))
+ luaL_argerror(L, 3, "string 'multiaddr' field expected");
+ if (!inet_aton(lua_tostring(L, -1), &val.imr_multiaddr))
+ luaL_argerror(L, 3, "invalid 'multiaddr' ip address");
+ lua_pushstring(L, "interface");
+ lua_gettable(L, 3);
+ if (!lua_isstring(L, -1))
+ luaL_argerror(L, 3, "string 'interface' field expected");
+ val.imr_interface.s_addr = htonl(INADDR_ANY);
+ if (strcmp(lua_tostring(L, -1), "*") &&
+ !inet_aton(lua_tostring(L, -1), &val.imr_interface))
+ luaL_argerror(L, 3, "invalid 'interface' ip address");
+ return opt_set(L, ps, level, name, (char *) &val, sizeof(val));
+}
+
+static int opt_ip6_setmembership(lua_State *L, p_socket ps, int level, int name)
+{
+ struct ipv6_mreq val; /* obj, opt-name, table */
+ memset(&val, 0, sizeof(val));
+ if (!lua_istable(L, 3)) auxiliar_typeerror(L,3,lua_typename(L, LUA_TTABLE));
+ lua_pushstring(L, "multiaddr");
+ lua_gettable(L, 3);
+ if (!lua_isstring(L, -1))
+ luaL_argerror(L, 3, "string 'multiaddr' field expected");
+ if (!inet_pton(AF_INET6, lua_tostring(L, -1), &val.ipv6mr_multiaddr))
+ luaL_argerror(L, 3, "invalid 'multiaddr' ip address");
+ lua_pushstring(L, "interface");
+ lua_gettable(L, 3);
+ /* By default we listen to interface on default route
+ * (sigh). However, interface= can override it. We should
+ * support either number, or name for it. Waiting for
+ * windows port of if_nametoindex */
+ if (!lua_isnil(L, -1)) {
+ if (lua_isnumber(L, -1)) {
+ val.ipv6mr_interface = (unsigned int) lua_tonumber(L, -1);
+ } else
+ luaL_argerror(L, -1, "number 'interface' field expected");
+ }
+ return opt_set(L, ps, level, name, (char *) &val, sizeof(val));
+}
+
+static
+int opt_get(lua_State *L, p_socket ps, int level, int name, void *val, int* len)
+{
+ socklen_t socklen = *len;
+ if (getsockopt(*ps, level, name, (char *) val, &socklen) < 0) {
+ lua_pushnil(L);
+ lua_pushstring(L, "getsockopt failed");
+ return 2;
+ }
+ *len = socklen;
+ return 0;
+}
+
+static
+int opt_set(lua_State *L, p_socket ps, int level, int name, void *val, int len)
+{
+ if (setsockopt(*ps, level, name, (char *) val, len) < 0) {
+ lua_pushnil(L);
+ lua_pushstring(L, "setsockopt failed");
+ return 2;
+ }
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+static int opt_getboolean(lua_State *L, p_socket ps, int level, int name)
+{
+ int val = 0;
+ int len = sizeof(val);
+ int err = opt_get(L, ps, level, name, (char *) &val, &len);
+ if (err)
+ return err;
+ lua_pushboolean(L, val);
+ return 1;
+}
+
+int opt_get_error(lua_State *L, p_socket ps)
+{
+ int val = 0;
+ socklen_t len = sizeof(val);
+ if (getsockopt(*ps, SOL_SOCKET, SO_ERROR, (char *) &val, &len) < 0) {
+ lua_pushnil(L);
+ lua_pushstring(L, "getsockopt failed");
+ return 2;
+ }
+ lua_pushstring(L, socket_strerror(val));
+ return 1;
+}
+
+static int opt_setboolean(lua_State *L, p_socket ps, int level, int name)
+{
+ int val = auxiliar_checkboolean(L, 3); /* obj, name, bool */
+ return opt_set(L, ps, level, name, (char *) &val, sizeof(val));
+}
+
+static int opt_getint(lua_State *L, p_socket ps, int level, int name)
+{
+ int val = 0;
+ int len = sizeof(val);
+ int err = opt_get(L, ps, level, name, (char *) &val, &len);
+ if (err)
+ return err;
+ lua_pushnumber(L, val);
+ return 1;
+}
+
+static int opt_setint(lua_State *L, p_socket ps, int level, int name)
+{
+ int val = (int) lua_tonumber(L, 3); /* obj, name, int */
+ return opt_set(L, ps, level, name, (char *) &val, sizeof(val));
+}
diff --git a/src/options.h b/src/options.h
new file mode 100644
index 0000000..5657a06
--- /dev/null
+++ b/src/options.h
@@ -0,0 +1,60 @@
+#ifndef OPTIONS_H
+#define OPTIONS_H
+/*=========================================================================*\
+* Common option interface
+* LuaSocket toolkit
+*
+* This module provides a common interface to socket options, used mainly by
+* modules UDP and TCP.
+\*=========================================================================*/
+
+#include "lua.h"
+#include "socket.h"
+
+/* option registry */
+typedef struct t_opt {
+ const char *name;
+ int (*func)(lua_State *L, p_socket ps);
+} t_opt;
+typedef t_opt *p_opt;
+
+/* supported options for setoption */
+int opt_set_dontroute(lua_State *L, p_socket ps);
+int opt_set_broadcast(lua_State *L, p_socket ps);
+int opt_set_reuseaddr(lua_State *L, p_socket ps);
+int opt_set_tcp_nodelay(lua_State *L, p_socket ps);
+int opt_set_keepalive(lua_State *L, p_socket ps);
+int opt_set_linger(lua_State *L, p_socket ps);
+int opt_set_reuseaddr(lua_State *L, p_socket ps);
+int opt_set_reuseport(lua_State *L, p_socket ps);
+int opt_set_ip_multicast_if(lua_State *L, p_socket ps);
+int opt_set_ip_multicast_ttl(lua_State *L, p_socket ps);
+int opt_set_ip_multicast_loop(lua_State *L, p_socket ps);
+int opt_set_ip_add_membership(lua_State *L, p_socket ps);
+int opt_set_ip_drop_membersip(lua_State *L, p_socket ps);
+int opt_set_ip6_unicast_hops(lua_State *L, p_socket ps);
+int opt_set_ip6_multicast_hops(lua_State *L, p_socket ps);
+int opt_set_ip6_multicast_loop(lua_State *L, p_socket ps);
+int opt_set_ip6_add_membership(lua_State *L, p_socket ps);
+int opt_set_ip6_drop_membersip(lua_State *L, p_socket ps);
+int opt_set_ip6_v6only(lua_State *L, p_socket ps);
+
+/* supported options for getoption */
+int opt_get_reuseaddr(lua_State *L, p_socket ps);
+int opt_get_tcp_nodelay(lua_State *L, p_socket ps);
+int opt_get_keepalive(lua_State *L, p_socket ps);
+int opt_get_linger(lua_State *L, p_socket ps);
+int opt_get_reuseaddr(lua_State *L, p_socket ps);
+int opt_get_ip_multicast_loop(lua_State *L, p_socket ps);
+int opt_get_ip_multicast_if(lua_State *L, p_socket ps);
+int opt_get_error(lua_State *L, p_socket ps);
+int opt_get_ip6_multicast_loop(lua_State *L, p_socket ps);
+int opt_get_ip6_multicast_hops(lua_State *L, p_socket ps);
+int opt_get_ip6_unicast_hops(lua_State *L, p_socket ps);
+int opt_get_ip6_v6only(lua_State *L, p_socket ps);
+
+/* invokes the appropriate option handler */
+int opt_meth_setoption(lua_State *L, p_opt opt, p_socket ps);
+int opt_meth_getoption(lua_State *L, p_opt opt, p_socket ps);
+
+#endif
diff --git a/src/select.c b/src/select.c
new file mode 100644
index 0000000..fafaa62
--- /dev/null
+++ b/src/select.c
@@ -0,0 +1,220 @@
+/*=========================================================================*\
+* Select implementation
+* LuaSocket toolkit
+\*=========================================================================*/
+#include
+
+#include "lua.h"
+#include "lauxlib.h"
+
+#include "socket.h"
+#include "timeout.h"
+#include "select.h"
+
+/*=========================================================================*\
+* Internal function prototypes.
+\*=========================================================================*/
+static t_socket getfd(lua_State *L);
+static int dirty(lua_State *L);
+static void collect_fd(lua_State *L, int tab, int itab,
+ fd_set *set, t_socket *max_fd);
+static int check_dirty(lua_State *L, int tab, int dtab, fd_set *set);
+static void return_fd(lua_State *L, fd_set *set, t_socket max_fd,
+ int itab, int tab, int start);
+static void make_assoc(lua_State *L, int tab);
+static int global_select(lua_State *L);
+
+/* functions in library namespace */
+static luaL_Reg func[] = {
+ {"select", global_select},
+ {NULL, NULL}
+};
+
+/*=========================================================================*\
+* Exported functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Initializes module
+\*-------------------------------------------------------------------------*/
+int select_open(lua_State *L) {
+ lua_pushstring(L, "_SETSIZE");
+ lua_pushnumber(L, FD_SETSIZE);
+ lua_rawset(L, -3);
+#if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE)
+ luaL_setfuncs(L, func, 0);
+#else
+ luaL_openlib(L, NULL, func, 0);
+#endif
+ return 0;
+}
+
+/*=========================================================================*\
+* Global Lua functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Waits for a set of sockets until a condition is met or timeout.
+\*-------------------------------------------------------------------------*/
+static int global_select(lua_State *L) {
+ int rtab, wtab, itab, ret, ndirty;
+ t_socket max_fd = SOCKET_INVALID;
+ fd_set rset, wset;
+ t_timeout tm;
+ double t = luaL_optnumber(L, 3, -1);
+ FD_ZERO(&rset); FD_ZERO(&wset);
+ lua_settop(L, 3);
+ lua_newtable(L); itab = lua_gettop(L);
+ lua_newtable(L); rtab = lua_gettop(L);
+ lua_newtable(L); wtab = lua_gettop(L);
+ collect_fd(L, 1, itab, &rset, &max_fd);
+ collect_fd(L, 2, itab, &wset, &max_fd);
+ ndirty = check_dirty(L, 1, rtab, &rset);
+ t = ndirty > 0? 0.0: t;
+ timeout_init(&tm, t, -1);
+ timeout_markstart(&tm);
+ ret = socket_select(max_fd+1, &rset, &wset, NULL, &tm);
+ if (ret > 0 || ndirty > 0) {
+ return_fd(L, &rset, max_fd+1, itab, rtab, ndirty);
+ return_fd(L, &wset, max_fd+1, itab, wtab, 0);
+ make_assoc(L, rtab);
+ make_assoc(L, wtab);
+ return 2;
+ } else if (ret == 0) {
+ lua_pushstring(L, "timeout");
+ return 3;
+ } else {
+ luaL_error(L, "select failed");
+ return 3;
+ }
+}
+
+/*=========================================================================*\
+* Internal functions
+\*=========================================================================*/
+static t_socket getfd(lua_State *L) {
+ t_socket fd = SOCKET_INVALID;
+ lua_pushstring(L, "getfd");
+ lua_gettable(L, -2);
+ if (!lua_isnil(L, -1)) {
+ lua_pushvalue(L, -2);
+ lua_call(L, 1, 1);
+ if (lua_isnumber(L, -1)) {
+ double numfd = lua_tonumber(L, -1);
+ fd = (numfd >= 0.0)? (t_socket) numfd: SOCKET_INVALID;
+ }
+ }
+ lua_pop(L, 1);
+ return fd;
+}
+
+static int dirty(lua_State *L) {
+ int is = 0;
+ lua_pushstring(L, "dirty");
+ lua_gettable(L, -2);
+ if (!lua_isnil(L, -1)) {
+ lua_pushvalue(L, -2);
+ lua_call(L, 1, 1);
+ is = lua_toboolean(L, -1);
+ }
+ lua_pop(L, 1);
+ return is;
+}
+
+static void collect_fd(lua_State *L, int tab, int itab,
+ fd_set *set, t_socket *max_fd) {
+ int i = 1, n = 0;
+ /* nil is the same as an empty table */
+ if (lua_isnil(L, tab)) return;
+ /* otherwise we need it to be a table */
+ luaL_checktype(L, tab, LUA_TTABLE);
+ for ( ;; ) {
+ t_socket fd;
+ lua_pushnumber(L, i);
+ lua_gettable(L, tab);
+ if (lua_isnil(L, -1)) {
+ lua_pop(L, 1);
+ break;
+ }
+ /* getfd figures out if this is a socket */
+ fd = getfd(L);
+ if (fd != SOCKET_INVALID) {
+ /* make sure we don't overflow the fd_set */
+#ifdef _WIN32
+ if (n >= FD_SETSIZE)
+ luaL_argerror(L, tab, "too many sockets");
+#else
+ if (fd >= FD_SETSIZE)
+ luaL_argerror(L, tab, "descriptor too large for set size");
+#endif
+ FD_SET(fd, set);
+ n++;
+ /* keep track of the largest descriptor so far */
+ if (*max_fd == SOCKET_INVALID || *max_fd < fd)
+ *max_fd = fd;
+ /* make sure we can map back from descriptor to the object */
+ lua_pushnumber(L, (lua_Number) fd);
+ lua_pushvalue(L, -2);
+ lua_settable(L, itab);
+ }
+ lua_pop(L, 1);
+ i = i + 1;
+ }
+}
+
+static int check_dirty(lua_State *L, int tab, int dtab, fd_set *set) {
+ int ndirty = 0, i = 1;
+ if (lua_isnil(L, tab))
+ return 0;
+ for ( ;; ) {
+ t_socket fd;
+ lua_pushnumber(L, i);
+ lua_gettable(L, tab);
+ if (lua_isnil(L, -1)) {
+ lua_pop(L, 1);
+ break;
+ }
+ fd = getfd(L);
+ if (fd != SOCKET_INVALID && dirty(L)) {
+ lua_pushnumber(L, ++ndirty);
+ lua_pushvalue(L, -2);
+ lua_settable(L, dtab);
+ FD_CLR(fd, set);
+ }
+ lua_pop(L, 1);
+ i = i + 1;
+ }
+ return ndirty;
+}
+
+static void return_fd(lua_State *L, fd_set *set, t_socket max_fd,
+ int itab, int tab, int start) {
+ t_socket fd;
+ for (fd = 0; fd < max_fd; fd++) {
+ if (FD_ISSET(fd, set)) {
+ lua_pushnumber(L, ++start);
+ lua_pushnumber(L, (lua_Number) fd);
+ lua_gettable(L, itab);
+ lua_settable(L, tab);
+ }
+ }
+}
+
+static void make_assoc(lua_State *L, int tab) {
+ int i = 1, atab;
+ lua_newtable(L); atab = lua_gettop(L);
+ for ( ;; ) {
+ lua_pushnumber(L, i);
+ lua_gettable(L, tab);
+ if (!lua_isnil(L, -1)) {
+ lua_pushnumber(L, i);
+ lua_pushvalue(L, -2);
+ lua_settable(L, atab);
+ lua_pushnumber(L, i);
+ lua_settable(L, atab);
+ } else {
+ lua_pop(L, 1);
+ break;
+ }
+ i = i+1;
+ }
+}
+
diff --git a/src/select.h b/src/select.h
new file mode 100644
index 0000000..8750200
--- /dev/null
+++ b/src/select.h
@@ -0,0 +1,15 @@
+#ifndef SELECT_H
+#define SELECT_H
+/*=========================================================================*\
+* Select implementation
+* LuaSocket toolkit
+*
+* Each object that can be passed to the select function has to export
+* method getfd() which returns the descriptor to be passed to the
+* underlying select function. Another method, dirty(), should return
+* true if there is data ready for reading (required for buffered input).
+\*=========================================================================*/
+
+int select_open(lua_State *L);
+
+#endif /* SELECT_H */
diff --git a/src/serial.c b/src/serial.c
new file mode 100644
index 0000000..583d4e5
--- /dev/null
+++ b/src/serial.c
@@ -0,0 +1,188 @@
+/*=========================================================================*\
+* Serial stream
+* LuaSocket toolkit
+\*=========================================================================*/
+#include
+
+#include "lua.h"
+#include "lauxlib.h"
+
+#include "auxiliar.h"
+#include "socket.h"
+#include "options.h"
+#include "unix.h"
+#include
+
+/*
+Reuses userdata definition from unix.h, since it is useful for all
+stream-like objects.
+
+If we stored the serial path for use in error messages or userdata
+printing, we might need our own userdata definition.
+
+Group usage is semi-inherited from unix.c, but unnecessary since we
+have only one object type.
+*/
+
+/*=========================================================================*\
+* Internal function prototypes
+\*=========================================================================*/
+static int global_create(lua_State *L);
+static int meth_send(lua_State *L);
+static int meth_receive(lua_State *L);
+static int meth_close(lua_State *L);
+static int meth_settimeout(lua_State *L);
+static int meth_getfd(lua_State *L);
+static int meth_setfd(lua_State *L);
+static int meth_dirty(lua_State *L);
+static int meth_getstats(lua_State *L);
+static int meth_setstats(lua_State *L);
+
+/* serial object methods */
+static luaL_Reg serial_methods[] = {
+ {"__gc", meth_close},
+ {"__tostring", auxiliar_tostring},
+ {"close", meth_close},
+ {"dirty", meth_dirty},
+ {"getfd", meth_getfd},
+ {"getstats", meth_getstats},
+ {"setstats", meth_setstats},
+ {"receive", meth_receive},
+ {"send", meth_send},
+ {"setfd", meth_setfd},
+ {"settimeout", meth_settimeout},
+ {NULL, NULL}
+};
+
+/* our socket creation function */
+/* this is an ad-hoc module that returns a single function
+ * as such, do not include other functions in this array. */
+static luaL_Reg func[] = {
+ {"serial", global_create},
+ {NULL, NULL}
+};
+
+
+/*-------------------------------------------------------------------------*\
+* Initializes module
+\*-------------------------------------------------------------------------*/
+LUASOCKET_API int luaopen_socket_serial(lua_State *L) {
+ /* create classes */
+ auxiliar_newclass(L, "serial{client}", serial_methods);
+ /* create class groups */
+ auxiliar_add2group(L, "serial{client}", "serial{any}");
+#if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE)
+ lua_pushcfunction(L, global_create);
+ (void) func;
+#else
+ /* set function into socket namespace */
+ luaL_openlib(L, "socket", func, 0);
+ lua_pushcfunction(L, global_create);
+#endif
+ return 1;
+}
+
+/*=========================================================================*\
+* Lua methods
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Just call buffered IO methods
+\*-------------------------------------------------------------------------*/
+static int meth_send(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkclass(L, "serial{client}", 1);
+ return buffer_meth_send(L, &un->buf);
+}
+
+static int meth_receive(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkclass(L, "serial{client}", 1);
+ return buffer_meth_receive(L, &un->buf);
+}
+
+static int meth_getstats(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkclass(L, "serial{client}", 1);
+ return buffer_meth_getstats(L, &un->buf);
+}
+
+static int meth_setstats(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkclass(L, "serial{client}", 1);
+ return buffer_meth_setstats(L, &un->buf);
+}
+
+/*-------------------------------------------------------------------------*\
+* Select support methods
+\*-------------------------------------------------------------------------*/
+static int meth_getfd(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkgroup(L, "serial{any}", 1);
+ lua_pushnumber(L, (int) un->sock);
+ return 1;
+}
+
+/* this is very dangerous, but can be handy for those that are brave enough */
+static int meth_setfd(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkgroup(L, "serial{any}", 1);
+ un->sock = (t_socket) luaL_checknumber(L, 2);
+ return 0;
+}
+
+static int meth_dirty(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkgroup(L, "serial{any}", 1);
+ lua_pushboolean(L, !buffer_isempty(&un->buf));
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Closes socket used by object
+\*-------------------------------------------------------------------------*/
+static int meth_close(lua_State *L)
+{
+ p_unix un = (p_unix) auxiliar_checkgroup(L, "serial{any}", 1);
+ socket_destroy(&un->sock);
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+
+/*-------------------------------------------------------------------------*\
+* Just call tm methods
+\*-------------------------------------------------------------------------*/
+static int meth_settimeout(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkgroup(L, "serial{any}", 1);
+ return timeout_meth_settimeout(L, &un->tm);
+}
+
+/*=========================================================================*\
+* Library functions
+\*=========================================================================*/
+
+
+/*-------------------------------------------------------------------------*\
+* Creates a serial object
+\*-------------------------------------------------------------------------*/
+static int global_create(lua_State *L) {
+ const char* path = luaL_checkstring(L, 1);
+
+ /* allocate unix object */
+ p_unix un = (p_unix) lua_newuserdata(L, sizeof(t_unix));
+
+ /* open serial device */
+ t_socket sock = open(path, O_NOCTTY|O_RDWR);
+
+ /*printf("open %s on %d\n", path, sock);*/
+
+ if (sock < 0) {
+ lua_pushnil(L);
+ lua_pushstring(L, socket_strerror(errno));
+ lua_pushnumber(L, errno);
+ return 3;
+ }
+ /* set its type as client object */
+ auxiliar_setclass(L, "serial{client}", -1);
+ /* initialize remaining structure fields */
+ socket_setnonblocking(&sock);
+ un->sock = sock;
+ io_init(&un->io, (p_send) socket_write, (p_recv) socket_read,
+ (p_error) socket_ioerror, &un->sock);
+ timeout_init(&un->tm, -1, -1);
+ buffer_init(&un->buf, &un->io, &un->tm);
+ return 1;
+}
diff --git a/src/smtp.lua b/src/smtp.lua
new file mode 100644
index 0000000..b113d00
--- /dev/null
+++ b/src/smtp.lua
@@ -0,0 +1,256 @@
+-----------------------------------------------------------------------------
+-- SMTP client support for the Lua language.
+-- LuaSocket toolkit.
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+
+-----------------------------------------------------------------------------
+-- Declare module and import dependencies
+-----------------------------------------------------------------------------
+local base = _G
+local coroutine = require("coroutine")
+local string = require("string")
+local math = require("math")
+local os = require("os")
+local socket = require("socket")
+local tp = require("socket.tp")
+local ltn12 = require("ltn12")
+local headers = require("socket.headers")
+local mime = require("mime")
+
+socket.smtp = {}
+local _M = socket.smtp
+
+-----------------------------------------------------------------------------
+-- Program constants
+-----------------------------------------------------------------------------
+-- timeout for connection
+_M.TIMEOUT = 60
+-- default server used to send e-mails
+_M.SERVER = "localhost"
+-- default port
+_M.PORT = 25
+-- domain used in HELO command and default sendmail
+-- If we are under a CGI, try to get from environment
+_M.DOMAIN = os.getenv("SERVER_NAME") or "localhost"
+-- default time zone (means we don't know)
+_M.ZONE = "-0000"
+
+---------------------------------------------------------------------------
+-- Low level SMTP API
+-----------------------------------------------------------------------------
+local metat = { __index = {} }
+
+function metat.__index:greet(domain)
+ self.try(self.tp:check("2.."))
+ self.try(self.tp:command("EHLO", domain or _M.DOMAIN))
+ return socket.skip(1, self.try(self.tp:check("2..")))
+end
+
+function metat.__index:mail(from)
+ self.try(self.tp:command("MAIL", "FROM:" .. from))
+ return self.try(self.tp:check("2.."))
+end
+
+function metat.__index:rcpt(to)
+ self.try(self.tp:command("RCPT", "TO:" .. to))
+ return self.try(self.tp:check("2.."))
+end
+
+function metat.__index:data(src, step)
+ self.try(self.tp:command("DATA"))
+ self.try(self.tp:check("3.."))
+ self.try(self.tp:source(src, step))
+ self.try(self.tp:send("\r\n.\r\n"))
+ return self.try(self.tp:check("2.."))
+end
+
+function metat.__index:quit()
+ self.try(self.tp:command("QUIT"))
+ return self.try(self.tp:check("2.."))
+end
+
+function metat.__index:close()
+ return self.tp:close()
+end
+
+function metat.__index:login(user, password)
+ self.try(self.tp:command("AUTH", "LOGIN"))
+ self.try(self.tp:check("3.."))
+ self.try(self.tp:send(mime.b64(user) .. "\r\n"))
+ self.try(self.tp:check("3.."))
+ self.try(self.tp:send(mime.b64(password) .. "\r\n"))
+ return self.try(self.tp:check("2.."))
+end
+
+function metat.__index:plain(user, password)
+ local auth = "PLAIN " .. mime.b64("\0" .. user .. "\0" .. password)
+ self.try(self.tp:command("AUTH", auth))
+ return self.try(self.tp:check("2.."))
+end
+
+function metat.__index:auth(user, password, ext)
+ if not user or not password then return 1 end
+ if string.find(ext, "AUTH[^\n]+LOGIN") then
+ return self:login(user, password)
+ elseif string.find(ext, "AUTH[^\n]+PLAIN") then
+ return self:plain(user, password)
+ else
+ self.try(nil, "authentication not supported")
+ end
+end
+
+-- send message or throw an exception
+function metat.__index:send(mailt)
+ self:mail(mailt.from)
+ if base.type(mailt.rcpt) == "table" then
+ for i,v in base.ipairs(mailt.rcpt) do
+ self:rcpt(v)
+ end
+ else
+ self:rcpt(mailt.rcpt)
+ end
+ self:data(ltn12.source.chain(mailt.source, mime.stuff()), mailt.step)
+end
+
+function _M.open(server, port, create)
+ local tp = socket.try(tp.connect(server or _M.SERVER, port or _M.PORT,
+ _M.TIMEOUT, create))
+ local s = base.setmetatable({tp = tp}, metat)
+ -- make sure tp is closed if we get an exception
+ s.try = socket.newtry(function()
+ s:close()
+ end)
+ return s
+end
+
+-- convert headers to lowercase
+local function lower_headers(headers)
+ local lower = {}
+ for i,v in base.pairs(headers or lower) do
+ lower[string.lower(i)] = v
+ end
+ return lower
+end
+
+---------------------------------------------------------------------------
+-- Multipart message source
+-----------------------------------------------------------------------------
+-- returns a hopefully unique mime boundary
+local seqno = 0
+local function newboundary()
+ seqno = seqno + 1
+ return string.format('%s%05d==%05u', os.date('%d%m%Y%H%M%S'),
+ math.random(0, 99999), seqno)
+end
+
+-- send_message forward declaration
+local send_message
+
+-- yield the headers all at once, it's faster
+local function send_headers(tosend)
+ local canonic = headers.canonic
+ local h = "\r\n"
+ for f,v in base.pairs(tosend) do
+ h = (canonic[f] or f) .. ': ' .. v .. "\r\n" .. h
+ end
+ coroutine.yield(h)
+end
+
+-- yield multipart message body from a multipart message table
+local function send_multipart(mesgt)
+ -- make sure we have our boundary and send headers
+ local bd = newboundary()
+ local headers = lower_headers(mesgt.headers or {})
+ headers['content-type'] = headers['content-type'] or 'multipart/mixed'
+ headers['content-type'] = headers['content-type'] ..
+ '; boundary="' .. bd .. '"'
+ send_headers(headers)
+ -- send preamble
+ if mesgt.body.preamble then
+ coroutine.yield(mesgt.body.preamble)
+ coroutine.yield("\r\n")
+ end
+ -- send each part separated by a boundary
+ for i, m in base.ipairs(mesgt.body) do
+ coroutine.yield("\r\n--" .. bd .. "\r\n")
+ send_message(m)
+ end
+ -- send last boundary
+ coroutine.yield("\r\n--" .. bd .. "--\r\n\r\n")
+ -- send epilogue
+ if mesgt.body.epilogue then
+ coroutine.yield(mesgt.body.epilogue)
+ coroutine.yield("\r\n")
+ end
+end
+
+-- yield message body from a source
+local function send_source(mesgt)
+ -- make sure we have a content-type
+ local headers = lower_headers(mesgt.headers or {})
+ headers['content-type'] = headers['content-type'] or
+ 'text/plain; charset="iso-8859-1"'
+ send_headers(headers)
+ -- send body from source
+ while true do
+ local chunk, err = mesgt.body()
+ if err then coroutine.yield(nil, err)
+ elseif chunk then coroutine.yield(chunk)
+ else break end
+ end
+end
+
+-- yield message body from a string
+local function send_string(mesgt)
+ -- make sure we have a content-type
+ local headers = lower_headers(mesgt.headers or {})
+ headers['content-type'] = headers['content-type'] or
+ 'text/plain; charset="iso-8859-1"'
+ send_headers(headers)
+ -- send body from string
+ coroutine.yield(mesgt.body)
+end
+
+-- message source
+function send_message(mesgt)
+ if base.type(mesgt.body) == "table" then send_multipart(mesgt)
+ elseif base.type(mesgt.body) == "function" then send_source(mesgt)
+ else send_string(mesgt) end
+end
+
+-- set defaul headers
+local function adjust_headers(mesgt)
+ local lower = lower_headers(mesgt.headers)
+ lower["date"] = lower["date"] or
+ os.date("!%a, %d %b %Y %H:%M:%S ") .. (mesgt.zone or _M.ZONE)
+ lower["x-mailer"] = lower["x-mailer"] or socket._VERSION
+ -- this can't be overriden
+ lower["mime-version"] = "1.0"
+ return lower
+end
+
+function _M.message(mesgt)
+ mesgt.headers = adjust_headers(mesgt)
+ -- create and return message source
+ local co = coroutine.create(function() send_message(mesgt) end)
+ return function()
+ local ret, a, b = coroutine.resume(co)
+ if ret then return a, b
+ else return nil, a end
+ end
+end
+
+---------------------------------------------------------------------------
+-- High level SMTP API
+-----------------------------------------------------------------------------
+_M.send = socket.protect(function(mailt)
+ local s = _M.open(mailt.server, mailt.port, mailt.create)
+ local ext = s:greet(mailt.domain)
+ s:auth(mailt.user, mailt.password, ext)
+ s:send(mailt)
+ s:quit()
+ return s:close()
+end)
+
+return _M
\ No newline at end of file
diff --git a/src/socket.h b/src/socket.h
new file mode 100644
index 0000000..63573de
--- /dev/null
+++ b/src/socket.h
@@ -0,0 +1,78 @@
+#ifndef SOCKET_H
+#define SOCKET_H
+/*=========================================================================*\
+* Socket compatibilization module
+* LuaSocket toolkit
+*
+* BSD Sockets and WinSock are similar, but there are a few irritating
+* differences. Also, not all *nix platforms behave the same. This module
+* (and the associated usocket.h and wsocket.h) factor these differences and
+* creates a interface compatible with the io.h module.
+\*=========================================================================*/
+#include "io.h"
+
+/*=========================================================================*\
+* Platform specific compatibilization
+\*=========================================================================*/
+#ifdef _WIN32
+#include "wsocket.h"
+#else
+#include "usocket.h"
+#endif
+
+/*=========================================================================*\
+* The connect and accept functions accept a timeout and their
+* implementations are somewhat complicated. We chose to move
+* the timeout control into this module for these functions in
+* order to simplify the modules that use them.
+\*=========================================================================*/
+#include "timeout.h"
+
+/* we are lazy... */
+typedef struct sockaddr SA;
+
+/*=========================================================================*\
+* Functions bellow implement a comfortable platform independent
+* interface to sockets
+\*=========================================================================*/
+int socket_open(void);
+int socket_close(void);
+void socket_destroy(p_socket ps);
+void socket_shutdown(p_socket ps, int how);
+int socket_sendto(p_socket ps, const char *data, size_t count,
+ size_t *sent, SA *addr, socklen_t addr_len, p_timeout tm);
+int socket_recvfrom(p_socket ps, char *data, size_t count,
+ size_t *got, SA *addr, socklen_t *addr_len, p_timeout tm);
+
+void socket_setnonblocking(p_socket ps);
+void socket_setblocking(p_socket ps);
+
+int socket_waitfd(p_socket ps, int sw, p_timeout tm);
+int socket_select(t_socket n, fd_set *rfds, fd_set *wfds, fd_set *efds,
+ p_timeout tm);
+
+int socket_connect(p_socket ps, SA *addr, socklen_t addr_len, p_timeout tm);
+int socket_create(p_socket ps, int domain, int type, int protocol);
+int socket_bind(p_socket ps, SA *addr, socklen_t addr_len);
+int socket_listen(p_socket ps, int backlog);
+int socket_accept(p_socket ps, p_socket pa, SA *addr,
+ socklen_t *addr_len, p_timeout tm);
+
+const char *socket_hoststrerror(int err);
+const char *socket_gaistrerror(int err);
+const char *socket_strerror(int err);
+
+/* these are perfect to use with the io abstraction module
+ and the buffered input module */
+int socket_send(p_socket ps, const char *data, size_t count,
+ size_t *sent, p_timeout tm);
+int socket_recv(p_socket ps, char *data, size_t count, size_t *got, p_timeout tm);
+int socket_write(p_socket ps, const char *data, size_t count,
+ size_t *sent, p_timeout tm);
+int socket_read(p_socket ps, char *data, size_t count, size_t *got, p_timeout tm);
+const char *socket_ioerror(p_socket ps, int err);
+
+int socket_gethostbyaddr(const char *addr, socklen_t len, struct hostent **hp);
+int socket_gethostbyname(const char *addr, struct hostent **hp);
+
+#endif /* SOCKET_H */
diff --git a/src/socket.lua b/src/socket.lua
new file mode 100644
index 0000000..3913e6f
--- /dev/null
+++ b/src/socket.lua
@@ -0,0 +1,149 @@
+-----------------------------------------------------------------------------
+-- LuaSocket helper module
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+
+-----------------------------------------------------------------------------
+-- Declare module and import dependencies
+-----------------------------------------------------------------------------
+local base = _G
+local string = require("string")
+local math = require("math")
+local socket = require("socket.core")
+
+local _M = socket
+
+-----------------------------------------------------------------------------
+-- Exported auxiliar functions
+-----------------------------------------------------------------------------
+function _M.connect4(address, port, laddress, lport)
+ return socket.connect(address, port, laddress, lport, "inet")
+end
+
+function _M.connect6(address, port, laddress, lport)
+ return socket.connect(address, port, laddress, lport, "inet6")
+end
+
+function _M.bind(host, port, backlog)
+ if host == "*" then host = "0.0.0.0" end
+ local addrinfo, err = socket.dns.getaddrinfo(host);
+ if not addrinfo then return nil, err end
+ local sock, res
+ err = "no info on address"
+ for i, alt in base.ipairs(addrinfo) do
+ if alt.family == "inet" then
+ sock, err = socket.tcp()
+ else
+ sock, err = socket.tcp6()
+ end
+ if not sock then return nil, err end
+ sock:setoption("reuseaddr", true)
+ res, err = sock:bind(alt.addr, port)
+ if not res then
+ sock:close()
+ else
+ res, err = sock:listen(backlog)
+ if not res then
+ sock:close()
+ else
+ return sock
+ end
+ end
+ end
+ return nil, err
+end
+
+_M.try = _M.newtry()
+
+function _M.choose(table)
+ return function(name, opt1, opt2)
+ if base.type(name) ~= "string" then
+ name, opt1, opt2 = "default", name, opt1
+ end
+ local f = table[name or "nil"]
+ if not f then base.error("unknown key (".. base.tostring(name) ..")", 3)
+ else return f(opt1, opt2) end
+ end
+end
+
+-----------------------------------------------------------------------------
+-- Socket sources and sinks, conforming to LTN12
+-----------------------------------------------------------------------------
+-- create namespaces inside LuaSocket namespace
+local sourcet, sinkt = {}, {}
+_M.sourcet = sourcet
+_M.sinkt = sinkt
+
+_M.BLOCKSIZE = 2048
+
+sinkt["close-when-done"] = function(sock)
+ return base.setmetatable({
+ getfd = function() return sock:getfd() end,
+ dirty = function() return sock:dirty() end
+ }, {
+ __call = function(self, chunk, err)
+ if not chunk then
+ sock:close()
+ return 1
+ else return sock:send(chunk) end
+ end
+ })
+end
+
+sinkt["keep-open"] = function(sock)
+ return base.setmetatable({
+ getfd = function() return sock:getfd() end,
+ dirty = function() return sock:dirty() end
+ }, {
+ __call = function(self, chunk, err)
+ if chunk then return sock:send(chunk)
+ else return 1 end
+ end
+ })
+end
+
+sinkt["default"] = sinkt["keep-open"]
+
+_M.sink = _M.choose(sinkt)
+
+sourcet["by-length"] = function(sock, length)
+ return base.setmetatable({
+ getfd = function() return sock:getfd() end,
+ dirty = function() return sock:dirty() end
+ }, {
+ __call = function()
+ if length <= 0 then return nil end
+ local size = math.min(socket.BLOCKSIZE, length)
+ local chunk, err = sock:receive(size)
+ if err then return nil, err end
+ length = length - string.len(chunk)
+ return chunk
+ end
+ })
+end
+
+sourcet["until-closed"] = function(sock)
+ local done
+ return base.setmetatable({
+ getfd = function() return sock:getfd() end,
+ dirty = function() return sock:dirty() end
+ }, {
+ __call = function()
+ if done then return nil end
+ local chunk, err, partial = sock:receive(socket.BLOCKSIZE)
+ if not err then return chunk
+ elseif err == "closed" then
+ sock:close()
+ done = 1
+ return partial
+ else return nil, err end
+ end
+ })
+end
+
+
+sourcet["default"] = sourcet["until-closed"]
+
+_M.source = _M.choose(sourcet)
+
+return _M
diff --git a/src/tcp.c b/src/tcp.c
new file mode 100644
index 0000000..6594bda
--- /dev/null
+++ b/src/tcp.c
@@ -0,0 +1,489 @@
+/*=========================================================================*\
+* TCP object
+* LuaSocket toolkit
+\*=========================================================================*/
+#include
+
+#include "lua.h"
+#include "lauxlib.h"
+
+#include "auxiliar.h"
+#include "socket.h"
+#include "inet.h"
+#include "options.h"
+#include "tcp.h"
+
+/*=========================================================================*\
+* Internal function prototypes
+\*=========================================================================*/
+static int global_create(lua_State *L);
+static int global_create6(lua_State *L);
+static int global_connect(lua_State *L);
+static int meth_connect(lua_State *L);
+static int meth_listen(lua_State *L);
+static int meth_getfamily(lua_State *L);
+static int meth_bind(lua_State *L);
+static int meth_send(lua_State *L);
+static int meth_getstats(lua_State *L);
+static int meth_setstats(lua_State *L);
+static int meth_getsockname(lua_State *L);
+static int meth_getpeername(lua_State *L);
+static int meth_shutdown(lua_State *L);
+static int meth_receive(lua_State *L);
+static int meth_accept(lua_State *L);
+static int meth_close(lua_State *L);
+static int meth_getoption(lua_State *L);
+static int meth_setoption(lua_State *L);
+static int meth_settimeout(lua_State *L);
+static int meth_getfd(lua_State *L);
+static int meth_setfd(lua_State *L);
+static int meth_dirty(lua_State *L);
+
+/* tcp object methods */
+static luaL_Reg tcp_methods[] = {
+ {"__gc", meth_close},
+ {"__tostring", auxiliar_tostring},
+ {"accept", meth_accept},
+ {"bind", meth_bind},
+ {"close", meth_close},
+ {"connect", meth_connect},
+ {"dirty", meth_dirty},
+ {"getfamily", meth_getfamily},
+ {"getfd", meth_getfd},
+ {"getoption", meth_getoption},
+ {"getpeername", meth_getpeername},
+ {"getsockname", meth_getsockname},
+ {"getstats", meth_getstats},
+ {"setstats", meth_setstats},
+ {"listen", meth_listen},
+ {"receive", meth_receive},
+ {"send", meth_send},
+ {"setfd", meth_setfd},
+ {"setoption", meth_setoption},
+ {"setpeername", meth_connect},
+ {"setsockname", meth_bind},
+ {"settimeout", meth_settimeout},
+ {"shutdown", meth_shutdown},
+ {NULL, NULL}
+};
+
+/* socket option handlers */
+static t_opt optget[] = {
+ {"keepalive", opt_get_keepalive},
+ {"reuseaddr", opt_get_reuseaddr},
+ {"tcp-nodelay", opt_get_tcp_nodelay},
+ {"linger", opt_get_linger},
+ {"error", opt_get_error},
+ {NULL, NULL}
+};
+
+static t_opt optset[] = {
+ {"keepalive", opt_set_keepalive},
+ {"reuseaddr", opt_set_reuseaddr},
+ {"tcp-nodelay", opt_set_tcp_nodelay},
+ {"ipv6-v6only", opt_set_ip6_v6only},
+ {"linger", opt_set_linger},
+ {NULL, NULL}
+};
+
+/* functions in library namespace */
+static luaL_Reg func[] = {
+ {"tcp", global_create},
+ {"tcp6", global_create6},
+ {"connect", global_connect},
+ {NULL, NULL}
+};
+
+/*-------------------------------------------------------------------------*\
+* Initializes module
+\*-------------------------------------------------------------------------*/
+int tcp_open(lua_State *L)
+{
+ /* create classes */
+ auxiliar_newclass(L, "tcp{master}", tcp_methods);
+ auxiliar_newclass(L, "tcp{client}", tcp_methods);
+ auxiliar_newclass(L, "tcp{server}", tcp_methods);
+ /* create class groups */
+ auxiliar_add2group(L, "tcp{master}", "tcp{any}");
+ auxiliar_add2group(L, "tcp{client}", "tcp{any}");
+ auxiliar_add2group(L, "tcp{server}", "tcp{any}");
+ /* define library functions */
+#if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE)
+ luaL_setfuncs(L, func, 0);
+#else
+ luaL_openlib(L, NULL, func, 0);
+#endif
+ return 0;
+}
+
+/*=========================================================================*\
+* Lua methods
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Just call buffered IO methods
+\*-------------------------------------------------------------------------*/
+static int meth_send(lua_State *L) {
+ p_tcp tcp = (p_tcp) auxiliar_checkclass(L, "tcp{client}", 1);
+ return buffer_meth_send(L, &tcp->buf);
+}
+
+static int meth_receive(lua_State *L) {
+ p_tcp tcp = (p_tcp) auxiliar_checkclass(L, "tcp{client}", 1);
+ return buffer_meth_receive(L, &tcp->buf);
+}
+
+static int meth_getstats(lua_State *L) {
+ p_tcp tcp = (p_tcp) auxiliar_checkclass(L, "tcp{client}", 1);
+ return buffer_meth_getstats(L, &tcp->buf);
+}
+
+static int meth_setstats(lua_State *L) {
+ p_tcp tcp = (p_tcp) auxiliar_checkclass(L, "tcp{client}", 1);
+ return buffer_meth_setstats(L, &tcp->buf);
+}
+
+/*-------------------------------------------------------------------------*\
+* Just call option handler
+\*-------------------------------------------------------------------------*/
+static int meth_getoption(lua_State *L)
+{
+ p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1);
+ return opt_meth_getoption(L, optget, &tcp->sock);
+}
+
+static int meth_setoption(lua_State *L)
+{
+ p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1);
+ return opt_meth_setoption(L, optset, &tcp->sock);
+}
+
+/*-------------------------------------------------------------------------*\
+* Select support methods
+\*-------------------------------------------------------------------------*/
+static int meth_getfd(lua_State *L)
+{
+ p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1);
+ lua_pushnumber(L, (int) tcp->sock);
+ return 1;
+}
+
+/* this is very dangerous, but can be handy for those that are brave enough */
+static int meth_setfd(lua_State *L)
+{
+ p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1);
+ tcp->sock = (t_socket) luaL_checknumber(L, 2);
+ return 0;
+}
+
+static int meth_dirty(lua_State *L)
+{
+ p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1);
+ lua_pushboolean(L, !buffer_isempty(&tcp->buf));
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Waits for and returns a client object attempting connection to the
+* server object
+\*-------------------------------------------------------------------------*/
+static int meth_accept(lua_State *L)
+{
+ p_tcp server = (p_tcp) auxiliar_checkclass(L, "tcp{server}", 1);
+ p_timeout tm = timeout_markstart(&server->tm);
+ t_socket sock;
+ const char *err = inet_tryaccept(&server->sock, server->family, &sock, tm);
+ /* if successful, push client socket */
+ if (err == NULL) {
+ p_tcp clnt = (p_tcp) lua_newuserdata(L, sizeof(t_tcp));
+ auxiliar_setclass(L, "tcp{client}", -1);
+ /* initialize structure fields */
+ memset(clnt, 0, sizeof(t_tcp));
+ socket_setnonblocking(&sock);
+ clnt->sock = sock;
+ io_init(&clnt->io, (p_send) socket_send, (p_recv) socket_recv,
+ (p_error) socket_ioerror, &clnt->sock);
+ timeout_init(&clnt->tm, -1, -1);
+ buffer_init(&clnt->buf, &clnt->io, &clnt->tm);
+ clnt->family = server->family;
+ return 1;
+ } else {
+ lua_pushnil(L);
+ lua_pushstring(L, err);
+ return 2;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Binds an object to an address
+\*-------------------------------------------------------------------------*/
+static int meth_bind(lua_State *L)
+{
+ p_tcp tcp = (p_tcp) auxiliar_checkclass(L, "tcp{master}", 1);
+ const char *address = luaL_checkstring(L, 2);
+ const char *port = luaL_checkstring(L, 3);
+ const char *err;
+ struct addrinfo bindhints;
+ memset(&bindhints, 0, sizeof(bindhints));
+ bindhints.ai_socktype = SOCK_STREAM;
+ bindhints.ai_family = tcp->family;
+ bindhints.ai_flags = AI_PASSIVE;
+ err = inet_trybind(&tcp->sock, address, port, &bindhints);
+ if (err) {
+ lua_pushnil(L);
+ lua_pushstring(L, err);
+ return 2;
+ }
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Turns a master tcp object into a client object.
+\*-------------------------------------------------------------------------*/
+static int meth_connect(lua_State *L)
+{
+ p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1);
+ const char *address = luaL_checkstring(L, 2);
+ const char *port = luaL_checkstring(L, 3);
+ struct addrinfo connecthints;
+ const char *err;
+ memset(&connecthints, 0, sizeof(connecthints));
+ connecthints.ai_socktype = SOCK_STREAM;
+ /* make sure we try to connect only to the same family */
+ connecthints.ai_family = tcp->family;
+ timeout_markstart(&tcp->tm);
+ err = inet_tryconnect(&tcp->sock, &tcp->family, address, port,
+ &tcp->tm, &connecthints);
+ /* have to set the class even if it failed due to non-blocking connects */
+ auxiliar_setclass(L, "tcp{client}", 1);
+ if (err) {
+ lua_pushnil(L);
+ lua_pushstring(L, err);
+ return 2;
+ }
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Closes socket used by object
+\*-------------------------------------------------------------------------*/
+static int meth_close(lua_State *L)
+{
+ p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1);
+ socket_destroy(&tcp->sock);
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Returns family as string
+\*-------------------------------------------------------------------------*/
+static int meth_getfamily(lua_State *L)
+{
+ p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1);
+ if (tcp->family == PF_INET6) {
+ lua_pushliteral(L, "inet6");
+ return 1;
+ } else {
+ lua_pushliteral(L, "inet4");
+ return 1;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Puts the sockt in listen mode
+\*-------------------------------------------------------------------------*/
+static int meth_listen(lua_State *L)
+{
+ p_tcp tcp = (p_tcp) auxiliar_checkclass(L, "tcp{master}", 1);
+ int backlog = (int) luaL_optnumber(L, 2, 32);
+ int err = socket_listen(&tcp->sock, backlog);
+ if (err != IO_DONE) {
+ lua_pushnil(L);
+ lua_pushstring(L, socket_strerror(err));
+ return 2;
+ }
+ /* turn master object into a server object */
+ auxiliar_setclass(L, "tcp{server}", 1);
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Shuts the connection down partially
+\*-------------------------------------------------------------------------*/
+static int meth_shutdown(lua_State *L)
+{
+ /* SHUT_RD, SHUT_WR, SHUT_RDWR have the value 0, 1, 2, so we can use method index directly */
+ static const char* methods[] = { "receive", "send", "both", NULL };
+ p_tcp tcp = (p_tcp) auxiliar_checkclass(L, "tcp{client}", 1);
+ int how = luaL_checkoption(L, 2, "both", methods);
+ socket_shutdown(&tcp->sock, how);
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Just call inet methods
+\*-------------------------------------------------------------------------*/
+static int meth_getpeername(lua_State *L)
+{
+ p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1);
+ return inet_meth_getpeername(L, &tcp->sock, tcp->family);
+}
+
+static int meth_getsockname(lua_State *L)
+{
+ p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1);
+ return inet_meth_getsockname(L, &tcp->sock, tcp->family);
+}
+
+/*-------------------------------------------------------------------------*\
+* Just call tm methods
+\*-------------------------------------------------------------------------*/
+static int meth_settimeout(lua_State *L)
+{
+ p_tcp tcp = (p_tcp) auxiliar_checkgroup(L, "tcp{any}", 1);
+ return timeout_meth_settimeout(L, &tcp->tm);
+}
+
+/*=========================================================================*\
+* Library functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Creates a master tcp object
+\*-------------------------------------------------------------------------*/
+static int tcp_create(lua_State *L, int family) {
+ t_socket sock;
+ const char *err = inet_trycreate(&sock, family, SOCK_STREAM);
+ /* try to allocate a system socket */
+ if (!err) {
+ /* allocate tcp object */
+ p_tcp tcp = (p_tcp) lua_newuserdata(L, sizeof(t_tcp));
+ memset(tcp, 0, sizeof(t_tcp));
+ /* set its type as master object */
+ auxiliar_setclass(L, "tcp{master}", -1);
+ /* initialize remaining structure fields */
+ socket_setnonblocking(&sock);
+ if (family == PF_INET6) {
+ int yes = 1;
+ setsockopt(sock, IPPROTO_IPV6, IPV6_V6ONLY,
+ (void *)&yes, sizeof(yes));
+ }
+ tcp->sock = sock;
+ io_init(&tcp->io, (p_send) socket_send, (p_recv) socket_recv,
+ (p_error) socket_ioerror, &tcp->sock);
+ timeout_init(&tcp->tm, -1, -1);
+ buffer_init(&tcp->buf, &tcp->io, &tcp->tm);
+ tcp->family = family;
+ return 1;
+ } else {
+ lua_pushnil(L);
+ lua_pushstring(L, err);
+ return 2;
+ }
+}
+
+static int global_create(lua_State *L) {
+ return tcp_create(L, AF_INET);
+}
+
+static int global_create6(lua_State *L) {
+ return tcp_create(L, AF_INET6);
+}
+
+#if 0
+static const char *tryconnect6(const char *remoteaddr, const char *remoteserv,
+ struct addrinfo *connecthints, p_tcp tcp) {
+ struct addrinfo *iterator = NULL, *resolved = NULL;
+ const char *err = NULL;
+ /* try resolving */
+ err = socket_gaistrerror(getaddrinfo(remoteaddr, remoteserv,
+ connecthints, &resolved));
+ if (err != NULL) {
+ if (resolved) freeaddrinfo(resolved);
+ return err;
+ }
+ /* iterate over all returned addresses trying to connect */
+ for (iterator = resolved; iterator; iterator = iterator->ai_next) {
+ p_timeout tm = timeout_markstart(&tcp->tm);
+ /* create new socket if necessary. if there was no
+ * bind, we need to create one for every new family
+ * that shows up while iterating. if there was a
+ * bind, all families will be the same and we will
+ * not enter this branch. */
+ if (tcp->family != iterator->ai_family) {
+ socket_destroy(&tcp->sock);
+ err = socket_strerror(socket_create(&tcp->sock,
+ iterator->ai_family, iterator->ai_socktype,
+ iterator->ai_protocol));
+ if (err != NULL) {
+ freeaddrinfo(resolved);
+ return err;
+ }
+ tcp->family = iterator->ai_family;
+ /* all sockets initially non-blocking */
+ socket_setnonblocking(&tcp->sock);
+ }
+ /* finally try connecting to remote address */
+ err = socket_strerror(socket_connect(&tcp->sock,
+ (SA *) iterator->ai_addr,
+ (socklen_t) iterator->ai_addrlen, tm));
+ /* if success, break out of loop */
+ if (err == NULL) break;
+ }
+
+ freeaddrinfo(resolved);
+ /* here, if err is set, we failed */
+ return err;
+}
+#endif
+
+static int global_connect(lua_State *L) {
+ const char *remoteaddr = luaL_checkstring(L, 1);
+ const char *remoteserv = luaL_checkstring(L, 2);
+ const char *localaddr = luaL_optstring(L, 3, NULL);
+ const char *localserv = luaL_optstring(L, 4, "0");
+ int family = inet_optfamily(L, 5, "unspec");
+ p_tcp tcp = (p_tcp) lua_newuserdata(L, sizeof(t_tcp));
+ struct addrinfo bindhints, connecthints;
+ const char *err = NULL;
+ /* initialize tcp structure */
+ memset(tcp, 0, sizeof(t_tcp));
+ io_init(&tcp->io, (p_send) socket_send, (p_recv) socket_recv,
+ (p_error) socket_ioerror, &tcp->sock);
+ timeout_init(&tcp->tm, -1, -1);
+ buffer_init(&tcp->buf, &tcp->io, &tcp->tm);
+ tcp->sock = SOCKET_INVALID;
+ tcp->family = PF_UNSPEC;
+ /* allow user to pick local address and port */
+ memset(&bindhints, 0, sizeof(bindhints));
+ bindhints.ai_socktype = SOCK_STREAM;
+ bindhints.ai_family = family;
+ bindhints.ai_flags = AI_PASSIVE;
+ if (localaddr) {
+ err = inet_trybind(&tcp->sock, localaddr, localserv, &bindhints);
+ if (err) {
+ lua_pushnil(L);
+ lua_pushstring(L, err);
+ return 2;
+ }
+ tcp->family = bindhints.ai_family;
+ }
+ /* try to connect to remote address and port */
+ memset(&connecthints, 0, sizeof(connecthints));
+ connecthints.ai_socktype = SOCK_STREAM;
+ /* make sure we try to connect only to the same family */
+ connecthints.ai_family = bindhints.ai_family;
+ err = inet_tryconnect(&tcp->sock, &tcp->family, remoteaddr, remoteserv,
+ &tcp->tm, &connecthints);
+ if (err) {
+ socket_destroy(&tcp->sock);
+ lua_pushnil(L);
+ lua_pushstring(L, err);
+ return 2;
+ }
+ auxiliar_setclass(L, "tcp{client}", -1);
+ return 1;
+}
diff --git a/src/tcp.h b/src/tcp.h
new file mode 100644
index 0000000..eded620
--- /dev/null
+++ b/src/tcp.h
@@ -0,0 +1,35 @@
+#ifndef TCP_H
+#define TCP_H
+/*=========================================================================*\
+* TCP object
+* LuaSocket toolkit
+*
+* The tcp.h module is basicly a glue that puts together modules buffer.h,
+* timeout.h socket.h and inet.h to provide the LuaSocket TCP (AF_INET,
+* SOCK_STREAM) support.
+*
+* Three classes are defined: master, client and server. The master class is
+* a newly created tcp object, that has not been bound or connected. Server
+* objects are tcp objects bound to some local address. Client objects are
+* tcp objects either connected to some address or returned by the accept
+* method of a server object.
+\*=========================================================================*/
+#include "lua.h"
+
+#include "buffer.h"
+#include "timeout.h"
+#include "socket.h"
+
+typedef struct t_tcp_ {
+ t_socket sock;
+ t_io io;
+ t_buffer buf;
+ t_timeout tm;
+ int family;
+} t_tcp;
+
+typedef t_tcp *p_tcp;
+
+int tcp_open(lua_State *L);
+
+#endif /* TCP_H */
diff --git a/src/timeout.c b/src/timeout.c
new file mode 100644
index 0000000..bdd5e1c
--- /dev/null
+++ b/src/timeout.c
@@ -0,0 +1,221 @@
+/*=========================================================================*\
+* Timeout management functions
+* LuaSocket toolkit
+\*=========================================================================*/
+#include
+#include
+#include
+
+#include "lua.h"
+#include "lauxlib.h"
+
+#include "auxiliar.h"
+#include "timeout.h"
+
+#ifdef _WIN32
+#include
+#else
+#include
+#include
+#endif
+
+/* min and max macros */
+#ifndef MIN
+#define MIN(x, y) ((x) < (y) ? x : y)
+#endif
+#ifndef MAX
+#define MAX(x, y) ((x) > (y) ? x : y)
+#endif
+
+/*=========================================================================*\
+* Internal function prototypes
+\*=========================================================================*/
+static int timeout_lua_gettime(lua_State *L);
+static int timeout_lua_sleep(lua_State *L);
+
+static luaL_Reg func[] = {
+ { "gettime", timeout_lua_gettime },
+ { "sleep", timeout_lua_sleep },
+ { NULL, NULL }
+};
+
+/*=========================================================================*\
+* Exported functions.
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Initialize structure
+\*-------------------------------------------------------------------------*/
+void timeout_init(p_timeout tm, double block, double total) {
+ tm->block = block;
+ tm->total = total;
+}
+
+/*-------------------------------------------------------------------------*\
+* Determines how much time we have left for the next system call,
+* if the previous call was successful
+* Input
+* tm: timeout control structure
+* Returns
+* the number of ms left or -1 if there is no time limit
+\*-------------------------------------------------------------------------*/
+double timeout_get(p_timeout tm) {
+ if (tm->block < 0.0 && tm->total < 0.0) {
+ return -1;
+ } else if (tm->block < 0.0) {
+ double t = tm->total - timeout_gettime() + tm->start;
+ return MAX(t, 0.0);
+ } else if (tm->total < 0.0) {
+ return tm->block;
+ } else {
+ double t = tm->total - timeout_gettime() + tm->start;
+ return MIN(tm->block, MAX(t, 0.0));
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Returns time since start of operation
+* Input
+* tm: timeout control structure
+* Returns
+* start field of structure
+\*-------------------------------------------------------------------------*/
+double timeout_getstart(p_timeout tm) {
+ return tm->start;
+}
+
+/*-------------------------------------------------------------------------*\
+* Determines how much time we have left for the next system call,
+* if the previous call was a failure
+* Input
+* tm: timeout control structure
+* Returns
+* the number of ms left or -1 if there is no time limit
+\*-------------------------------------------------------------------------*/
+double timeout_getretry(p_timeout tm) {
+ if (tm->block < 0.0 && tm->total < 0.0) {
+ return -1;
+ } else if (tm->block < 0.0) {
+ double t = tm->total - timeout_gettime() + tm->start;
+ return MAX(t, 0.0);
+ } else if (tm->total < 0.0) {
+ double t = tm->block - timeout_gettime() + tm->start;
+ return MAX(t, 0.0);
+ } else {
+ double t = tm->total - timeout_gettime() + tm->start;
+ return MIN(tm->block, MAX(t, 0.0));
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Marks the operation start time in structure
+* Input
+* tm: timeout control structure
+\*-------------------------------------------------------------------------*/
+p_timeout timeout_markstart(p_timeout tm) {
+ tm->start = timeout_gettime();
+ return tm;
+}
+
+/*-------------------------------------------------------------------------*\
+* Gets time in s, relative to January 1, 1970 (UTC)
+* Returns
+* time in s.
+\*-------------------------------------------------------------------------*/
+#ifdef _WIN32
+double timeout_gettime(void) {
+ FILETIME ft;
+ double t;
+ GetSystemTimeAsFileTime(&ft);
+ /* Windows file time (time since January 1, 1601 (UTC)) */
+ t = ft.dwLowDateTime/1.0e7 + ft.dwHighDateTime*(4294967296.0/1.0e7);
+ /* convert to Unix Epoch time (time since January 1, 1970 (UTC)) */
+ return (t - 11644473600.0);
+}
+#else
+double timeout_gettime(void) {
+ struct timeval v;
+ gettimeofday(&v, (struct timezone *) NULL);
+ /* Unix Epoch time (time since January 1, 1970 (UTC)) */
+ return v.tv_sec + v.tv_usec/1.0e6;
+}
+#endif
+
+/*-------------------------------------------------------------------------*\
+* Initializes module
+\*-------------------------------------------------------------------------*/
+int timeout_open(lua_State *L) {
+#if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE)
+ luaL_setfuncs(L, func, 0);
+#else
+ luaL_openlib(L, NULL, func, 0);
+#endif
+ return 0;
+}
+
+/*-------------------------------------------------------------------------*\
+* Sets timeout values for IO operations
+* Lua Input: base, time [, mode]
+* time: time out value in seconds
+* mode: "b" for block timeout, "t" for total timeout. (default: b)
+\*-------------------------------------------------------------------------*/
+int timeout_meth_settimeout(lua_State *L, p_timeout tm) {
+ double t = luaL_optnumber(L, 2, -1);
+ const char *mode = luaL_optstring(L, 3, "b");
+ switch (*mode) {
+ case 'b':
+ tm->block = t;
+ break;
+ case 'r': case 't':
+ tm->total = t;
+ break;
+ default:
+ luaL_argcheck(L, 0, 3, "invalid timeout mode");
+ break;
+ }
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+/*=========================================================================*\
+* Test support functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Returns the time the system has been up, in secconds.
+\*-------------------------------------------------------------------------*/
+static int timeout_lua_gettime(lua_State *L)
+{
+ lua_pushnumber(L, timeout_gettime());
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Sleep for n seconds.
+\*-------------------------------------------------------------------------*/
+#ifdef _WIN32
+int timeout_lua_sleep(lua_State *L)
+{
+ double n = luaL_checknumber(L, 1);
+ if (n < 0.0) n = 0.0;
+ if (n < DBL_MAX/1000.0) n *= 1000.0;
+ if (n > INT_MAX) n = INT_MAX;
+ Sleep((int)n);
+ return 0;
+}
+#else
+int timeout_lua_sleep(lua_State *L)
+{
+ double n = luaL_checknumber(L, 1);
+ struct timespec t, r;
+ if (n < 0.0) n = 0.0;
+ if (n > INT_MAX) n = INT_MAX;
+ t.tv_sec = (int) n;
+ n -= t.tv_sec;
+ t.tv_nsec = (int) (n * 1000000000);
+ if (t.tv_nsec >= 1000000000) t.tv_nsec = 999999999;
+ while (nanosleep(&t, &r) != 0) {
+ t.tv_sec = r.tv_sec;
+ t.tv_nsec = r.tv_nsec;
+ }
+ return 0;
+}
+#endif
diff --git a/src/timeout.h b/src/timeout.h
new file mode 100644
index 0000000..6715ca7
--- /dev/null
+++ b/src/timeout.h
@@ -0,0 +1,28 @@
+#ifndef TIMEOUT_H
+#define TIMEOUT_H
+/*=========================================================================*\
+* Timeout management functions
+* LuaSocket toolkit
+\*=========================================================================*/
+#include "lua.h"
+
+/* timeout control structure */
+typedef struct t_timeout_ {
+ double block; /* maximum time for blocking calls */
+ double total; /* total number of miliseconds for operation */
+ double start; /* time of start of operation */
+} t_timeout;
+typedef t_timeout *p_timeout;
+
+int timeout_open(lua_State *L);
+void timeout_init(p_timeout tm, double block, double total);
+double timeout_get(p_timeout tm);
+double timeout_getretry(p_timeout tm);
+p_timeout timeout_markstart(p_timeout tm);
+double timeout_getstart(p_timeout tm);
+double timeout_gettime(void);
+int timeout_meth_settimeout(lua_State *L, p_timeout tm);
+
+#define timeout_iszero(tm) ((tm)->block == 0.0)
+
+#endif /* TIMEOUT_H */
diff --git a/src/tp.lua b/src/tp.lua
new file mode 100644
index 0000000..cbeff56
--- /dev/null
+++ b/src/tp.lua
@@ -0,0 +1,126 @@
+-----------------------------------------------------------------------------
+-- Unified SMTP/FTP subsystem
+-- LuaSocket toolkit.
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+
+-----------------------------------------------------------------------------
+-- Declare module and import dependencies
+-----------------------------------------------------------------------------
+local base = _G
+local string = require("string")
+local socket = require("socket")
+local ltn12 = require("ltn12")
+
+socket.tp = {}
+local _M = socket.tp
+
+-----------------------------------------------------------------------------
+-- Program constants
+-----------------------------------------------------------------------------
+_M.TIMEOUT = 60
+
+-----------------------------------------------------------------------------
+-- Implementation
+-----------------------------------------------------------------------------
+-- gets server reply (works for SMTP and FTP)
+local function get_reply(c)
+ local code, current, sep
+ local line, err = c:receive()
+ local reply = line
+ if err then return nil, err end
+ code, sep = socket.skip(2, string.find(line, "^(%d%d%d)(.?)"))
+ if not code then return nil, "invalid server reply" end
+ if sep == "-" then -- reply is multiline
+ repeat
+ line, err = c:receive()
+ if err then return nil, err end
+ current, sep = socket.skip(2, string.find(line, "^(%d%d%d)(.?)"))
+ reply = reply .. "\n" .. line
+ -- reply ends with same code
+ until code == current and sep == " "
+ end
+ return code, reply
+end
+
+-- metatable for sock object
+local metat = { __index = {} }
+
+function metat.__index:check(ok)
+ local code, reply = get_reply(self.c)
+ if not code then return nil, reply end
+ if base.type(ok) ~= "function" then
+ if base.type(ok) == "table" then
+ for i, v in base.ipairs(ok) do
+ if string.find(code, v) then
+ return base.tonumber(code), reply
+ end
+ end
+ return nil, reply
+ else
+ if string.find(code, ok) then return base.tonumber(code), reply
+ else return nil, reply end
+ end
+ else return ok(base.tonumber(code), reply) end
+end
+
+function metat.__index:command(cmd, arg)
+ cmd = string.upper(cmd)
+ if arg then
+ return self.c:send(cmd .. " " .. arg.. "\r\n")
+ else
+ return self.c:send(cmd .. "\r\n")
+ end
+end
+
+function metat.__index:sink(snk, pat)
+ local chunk, err = c:receive(pat)
+ return snk(chunk, err)
+end
+
+function metat.__index:send(data)
+ return self.c:send(data)
+end
+
+function metat.__index:receive(pat)
+ return self.c:receive(pat)
+end
+
+function metat.__index:getfd()
+ return self.c:getfd()
+end
+
+function metat.__index:dirty()
+ return self.c:dirty()
+end
+
+function metat.__index:getcontrol()
+ return self.c
+end
+
+function metat.__index:source(source, step)
+ local sink = socket.sink("keep-open", self.c)
+ local ret, err = ltn12.pump.all(source, sink, step or ltn12.pump.step)
+ return ret, err
+end
+
+-- closes the underlying c
+function metat.__index:close()
+ self.c:close()
+ return 1
+end
+
+-- connect with server and return c object
+function _M.connect(host, port, timeout, create)
+ local c, e = (create or socket.tcp)()
+ if not c then return nil, e end
+ c:settimeout(timeout or _M.TIMEOUT)
+ local r, e = c:connect(host, port)
+ if not r then
+ c:close()
+ return nil, e
+ end
+ return base.setmetatable({c = c}, metat)
+end
+
+return _M
\ No newline at end of file
diff --git a/src/udp.c b/src/udp.c
new file mode 100644
index 0000000..a9f2393
--- /dev/null
+++ b/src/udp.c
@@ -0,0 +1,441 @@
+/*=========================================================================*\
+* UDP object
+* LuaSocket toolkit
+\*=========================================================================*/
+#include
+#include
+
+#include "lua.h"
+#include "lauxlib.h"
+
+#include "auxiliar.h"
+#include "socket.h"
+#include "inet.h"
+#include "options.h"
+#include "udp.h"
+
+/* min and max macros */
+#ifndef MIN
+#define MIN(x, y) ((x) < (y) ? x : y)
+#endif
+#ifndef MAX
+#define MAX(x, y) ((x) > (y) ? x : y)
+#endif
+
+/*=========================================================================*\
+* Internal function prototypes
+\*=========================================================================*/
+static int global_create(lua_State *L);
+static int global_create6(lua_State *L);
+static int meth_send(lua_State *L);
+static int meth_sendto(lua_State *L);
+static int meth_receive(lua_State *L);
+static int meth_receivefrom(lua_State *L);
+static int meth_getfamily(lua_State *L);
+static int meth_getsockname(lua_State *L);
+static int meth_getpeername(lua_State *L);
+static int meth_setsockname(lua_State *L);
+static int meth_setpeername(lua_State *L);
+static int meth_close(lua_State *L);
+static int meth_setoption(lua_State *L);
+static int meth_getoption(lua_State *L);
+static int meth_settimeout(lua_State *L);
+static int meth_getfd(lua_State *L);
+static int meth_setfd(lua_State *L);
+static int meth_dirty(lua_State *L);
+
+/* udp object methods */
+static luaL_Reg udp_methods[] = {
+ {"__gc", meth_close},
+ {"__tostring", auxiliar_tostring},
+ {"close", meth_close},
+ {"dirty", meth_dirty},
+ {"getfamily", meth_getfamily},
+ {"getfd", meth_getfd},
+ {"getpeername", meth_getpeername},
+ {"getsockname", meth_getsockname},
+ {"receive", meth_receive},
+ {"receivefrom", meth_receivefrom},
+ {"send", meth_send},
+ {"sendto", meth_sendto},
+ {"setfd", meth_setfd},
+ {"setoption", meth_setoption},
+ {"getoption", meth_getoption},
+ {"setpeername", meth_setpeername},
+ {"setsockname", meth_setsockname},
+ {"settimeout", meth_settimeout},
+ {NULL, NULL}
+};
+
+/* socket options for setoption */
+static t_opt optset[] = {
+ {"dontroute", opt_set_dontroute},
+ {"broadcast", opt_set_broadcast},
+ {"reuseaddr", opt_set_reuseaddr},
+ {"reuseport", opt_set_reuseport},
+ {"ip-multicast-if", opt_set_ip_multicast_if},
+ {"ip-multicast-ttl", opt_set_ip_multicast_ttl},
+ {"ip-multicast-loop", opt_set_ip_multicast_loop},
+ {"ip-add-membership", opt_set_ip_add_membership},
+ {"ip-drop-membership", opt_set_ip_drop_membersip},
+ {"ipv6-unicast-hops", opt_set_ip6_unicast_hops},
+ {"ipv6-multicast-hops", opt_set_ip6_unicast_hops},
+ {"ipv6-multicast-loop", opt_set_ip6_multicast_loop},
+ {"ipv6-add-membership", opt_set_ip6_add_membership},
+ {"ipv6-drop-membership", opt_set_ip6_drop_membersip},
+ {"ipv6-v6only", opt_set_ip6_v6only},
+ {NULL, NULL}
+};
+
+/* socket options for getoption */
+static t_opt optget[] = {
+ {"ip-multicast-if", opt_get_ip_multicast_if},
+ {"ip-multicast-loop", opt_get_ip_multicast_loop},
+ {"error", opt_get_error},
+ {"ipv6-unicast-hops", opt_get_ip6_unicast_hops},
+ {"ipv6-multicast-hops", opt_get_ip6_unicast_hops},
+ {"ipv6-multicast-loop", opt_get_ip6_multicast_loop},
+ {"ipv6-v6only", opt_get_ip6_v6only},
+ {NULL, NULL}
+};
+
+/* functions in library namespace */
+static luaL_Reg func[] = {
+ {"udp", global_create},
+ {"udp6", global_create6},
+ {NULL, NULL}
+};
+
+/*-------------------------------------------------------------------------*\
+* Initializes module
+\*-------------------------------------------------------------------------*/
+int udp_open(lua_State *L)
+{
+ /* create classes */
+ auxiliar_newclass(L, "udp{connected}", udp_methods);
+ auxiliar_newclass(L, "udp{unconnected}", udp_methods);
+ /* create class groups */
+ auxiliar_add2group(L, "udp{connected}", "udp{any}");
+ auxiliar_add2group(L, "udp{unconnected}", "udp{any}");
+ auxiliar_add2group(L, "udp{connected}", "select{able}");
+ auxiliar_add2group(L, "udp{unconnected}", "select{able}");
+ /* define library functions */
+#if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE)
+ luaL_setfuncs(L, func, 0);
+#else
+ luaL_openlib(L, NULL, func, 0);
+#endif
+ return 0;
+}
+
+/*=========================================================================*\
+* Lua methods
+\*=========================================================================*/
+const char *udp_strerror(int err) {
+ /* a 'closed' error on an unconnected means the target address was not
+ * accepted by the transport layer */
+ if (err == IO_CLOSED) return "refused";
+ else return socket_strerror(err);
+}
+
+/*-------------------------------------------------------------------------*\
+* Send data through connected udp socket
+\*-------------------------------------------------------------------------*/
+static int meth_send(lua_State *L) {
+ p_udp udp = (p_udp) auxiliar_checkclass(L, "udp{connected}", 1);
+ p_timeout tm = &udp->tm;
+ size_t count, sent = 0;
+ int err;
+ const char *data = luaL_checklstring(L, 2, &count);
+ timeout_markstart(tm);
+ err = socket_send(&udp->sock, data, count, &sent, tm);
+ if (err != IO_DONE) {
+ lua_pushnil(L);
+ lua_pushstring(L, udp_strerror(err));
+ return 2;
+ }
+ lua_pushnumber(L, (lua_Number) sent);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Send data through unconnected udp socket
+\*-------------------------------------------------------------------------*/
+static int meth_sendto(lua_State *L) {
+ p_udp udp = (p_udp) auxiliar_checkclass(L, "udp{unconnected}", 1);
+ size_t count, sent = 0;
+ const char *data = luaL_checklstring(L, 2, &count);
+ const char *ip = luaL_checkstring(L, 3);
+ const char *port = luaL_checkstring(L, 4);
+ p_timeout tm = &udp->tm;
+ int err;
+ struct addrinfo aihint;
+ struct addrinfo *ai;
+ memset(&aihint, 0, sizeof(aihint));
+ aihint.ai_family = udp->family;
+ aihint.ai_socktype = SOCK_DGRAM;
+ aihint.ai_flags = AI_NUMERICHOST | AI_NUMERICSERV;
+ err = getaddrinfo(ip, port, &aihint, &ai);
+ if (err) {
+ lua_pushnil(L);
+ lua_pushstring(L, gai_strerror(err));
+ return 2;
+ }
+ timeout_markstart(tm);
+ err = socket_sendto(&udp->sock, data, count, &sent, ai->ai_addr,
+ (socklen_t) ai->ai_addrlen, tm);
+ freeaddrinfo(ai);
+ if (err != IO_DONE) {
+ lua_pushnil(L);
+ lua_pushstring(L, udp_strerror(err));
+ return 2;
+ }
+ lua_pushnumber(L, (lua_Number) sent);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Receives data from a UDP socket
+\*-------------------------------------------------------------------------*/
+static int meth_receive(lua_State *L) {
+ p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1);
+ char buffer[UDP_DATAGRAMSIZE];
+ size_t got, count = (size_t) luaL_optnumber(L, 2, sizeof(buffer));
+ int err;
+ p_timeout tm = &udp->tm;
+ count = MIN(count, sizeof(buffer));
+ timeout_markstart(tm);
+ err = socket_recv(&udp->sock, buffer, count, &got, tm);
+ /* Unlike TCP, recv() of zero is not closed, but a zero-length packet. */
+ if (err == IO_CLOSED)
+ err = IO_DONE;
+ if (err != IO_DONE) {
+ lua_pushnil(L);
+ lua_pushstring(L, udp_strerror(err));
+ return 2;
+ }
+ lua_pushlstring(L, buffer, got);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Receives data and sender from a UDP socket
+\*-------------------------------------------------------------------------*/
+static int meth_receivefrom(lua_State *L)
+{
+ p_udp udp = (p_udp) auxiliar_checkclass(L, "udp{unconnected}", 1);
+ char buffer[UDP_DATAGRAMSIZE];
+ size_t got, count = (size_t) luaL_optnumber(L, 2, sizeof(buffer));
+ int err;
+ p_timeout tm = &udp->tm;
+ struct sockaddr_storage addr;
+ socklen_t addr_len = sizeof(addr);
+ char addrstr[INET6_ADDRSTRLEN];
+ char portstr[6];
+ timeout_markstart(tm);
+ count = MIN(count, sizeof(buffer));
+ err = socket_recvfrom(&udp->sock, buffer, count, &got, (SA *) &addr,
+ &addr_len, tm);
+ /* Unlike TCP, recv() of zero is not closed, but a zero-length packet. */
+ if (err == IO_CLOSED)
+ err = IO_DONE;
+ if (err != IO_DONE) {
+ lua_pushnil(L);
+ lua_pushstring(L, udp_strerror(err));
+ return 2;
+ }
+ err = getnameinfo((struct sockaddr *)&addr, addr_len, addrstr,
+ INET6_ADDRSTRLEN, portstr, 6, NI_NUMERICHOST | NI_NUMERICSERV);
+ if (err) {
+ lua_pushnil(L);
+ lua_pushstring(L, gai_strerror(err));
+ return 2;
+ }
+ lua_pushlstring(L, buffer, got);
+ lua_pushstring(L, addrstr);
+ lua_pushinteger(L, (int) strtol(portstr, (char **) NULL, 10));
+ return 3;
+}
+
+/*-------------------------------------------------------------------------*\
+* Returns family as string
+\*-------------------------------------------------------------------------*/
+static int meth_getfamily(lua_State *L)
+{
+ p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1);
+ if (udp->family == PF_INET6) {
+ lua_pushliteral(L, "inet6");
+ return 1;
+ } else {
+ lua_pushliteral(L, "inet4");
+ return 1;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Select support methods
+\*-------------------------------------------------------------------------*/
+static int meth_getfd(lua_State *L) {
+ p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1);
+ lua_pushnumber(L, (int) udp->sock);
+ return 1;
+}
+
+/* this is very dangerous, but can be handy for those that are brave enough */
+static int meth_setfd(lua_State *L) {
+ p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1);
+ udp->sock = (t_socket) luaL_checknumber(L, 2);
+ return 0;
+}
+
+static int meth_dirty(lua_State *L) {
+ p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1);
+ (void) udp;
+ lua_pushboolean(L, 0);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Just call inet methods
+\*-------------------------------------------------------------------------*/
+static int meth_getpeername(lua_State *L) {
+ p_udp udp = (p_udp) auxiliar_checkclass(L, "udp{connected}", 1);
+ return inet_meth_getpeername(L, &udp->sock, udp->family);
+}
+
+static int meth_getsockname(lua_State *L) {
+ p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1);
+ return inet_meth_getsockname(L, &udp->sock, udp->family);
+}
+
+/*-------------------------------------------------------------------------*\
+* Just call option handler
+\*-------------------------------------------------------------------------*/
+static int meth_setoption(lua_State *L) {
+ p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1);
+ return opt_meth_setoption(L, optset, &udp->sock);
+}
+
+/*-------------------------------------------------------------------------*\
+* Just call option handler
+\*-------------------------------------------------------------------------*/
+static int meth_getoption(lua_State *L) {
+ p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1);
+ return opt_meth_getoption(L, optget, &udp->sock);
+}
+
+/*-------------------------------------------------------------------------*\
+* Just call tm methods
+\*-------------------------------------------------------------------------*/
+static int meth_settimeout(lua_State *L) {
+ p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1);
+ return timeout_meth_settimeout(L, &udp->tm);
+}
+
+/*-------------------------------------------------------------------------*\
+* Turns a master udp object into a client object.
+\*-------------------------------------------------------------------------*/
+static int meth_setpeername(lua_State *L) {
+ p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1);
+ p_timeout tm = &udp->tm;
+ const char *address = luaL_checkstring(L, 2);
+ int connecting = strcmp(address, "*");
+ const char *port = connecting? luaL_checkstring(L, 3): "0";
+ struct addrinfo connecthints;
+ const char *err;
+ memset(&connecthints, 0, sizeof(connecthints));
+ connecthints.ai_socktype = SOCK_DGRAM;
+ /* make sure we try to connect only to the same family */
+ connecthints.ai_family = udp->family;
+ if (connecting) {
+ err = inet_tryconnect(&udp->sock, &udp->family, address,
+ port, tm, &connecthints);
+ if (err) {
+ lua_pushnil(L);
+ lua_pushstring(L, err);
+ return 2;
+ }
+ auxiliar_setclass(L, "udp{connected}", 1);
+ } else {
+ /* we ignore possible errors because Mac OS X always
+ * returns EAFNOSUPPORT */
+ inet_trydisconnect(&udp->sock, udp->family, tm);
+ auxiliar_setclass(L, "udp{unconnected}", 1);
+ }
+ /* change class to connected or unconnected depending on address */
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Closes socket used by object
+\*-------------------------------------------------------------------------*/
+static int meth_close(lua_State *L) {
+ p_udp udp = (p_udp) auxiliar_checkgroup(L, "udp{any}", 1);
+ socket_destroy(&udp->sock);
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Turns a master object into a server object
+\*-------------------------------------------------------------------------*/
+static int meth_setsockname(lua_State *L) {
+ p_udp udp = (p_udp) auxiliar_checkclass(L, "udp{unconnected}", 1);
+ const char *address = luaL_checkstring(L, 2);
+ const char *port = luaL_checkstring(L, 3);
+ const char *err;
+ struct addrinfo bindhints;
+ memset(&bindhints, 0, sizeof(bindhints));
+ bindhints.ai_socktype = SOCK_DGRAM;
+ bindhints.ai_family = udp->family;
+ bindhints.ai_flags = AI_PASSIVE;
+ err = inet_trybind(&udp->sock, address, port, &bindhints);
+ if (err) {
+ lua_pushnil(L);
+ lua_pushstring(L, err);
+ return 2;
+ }
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+/*=========================================================================*\
+* Library functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Creates a master udp object
+\*-------------------------------------------------------------------------*/
+static int udp_create(lua_State *L, int family) {
+ t_socket sock;
+ const char *err = inet_trycreate(&sock, family, SOCK_DGRAM);
+ /* try to allocate a system socket */
+ if (!err) {
+ /* allocate udp object */
+ p_udp udp = (p_udp) lua_newuserdata(L, sizeof(t_udp));
+ auxiliar_setclass(L, "udp{unconnected}", -1);
+ /* initialize remaining structure fields */
+ socket_setnonblocking(&sock);
+ if (family == PF_INET6) {
+ int yes = 1;
+ setsockopt(sock, IPPROTO_IPV6, IPV6_V6ONLY,
+ (void *)&yes, sizeof(yes));
+ }
+ udp->sock = sock;
+ timeout_init(&udp->tm, -1, -1);
+ udp->family = family;
+ return 1;
+ } else {
+ lua_pushnil(L);
+ lua_pushstring(L, err);
+ return 2;
+ }
+}
+
+static int global_create(lua_State *L) {
+ return udp_create(L, AF_INET);
+}
+
+static int global_create6(lua_State *L) {
+ return udp_create(L, AF_INET6);
+}
diff --git a/src/udp.h b/src/udp.h
new file mode 100644
index 0000000..2b831a5
--- /dev/null
+++ b/src/udp.h
@@ -0,0 +1,32 @@
+#ifndef UDP_H
+#define UDP_H
+/*=========================================================================*\
+* UDP object
+* LuaSocket toolkit
+*
+* The udp.h module provides LuaSocket with support for UDP protocol
+* (AF_INET, SOCK_DGRAM).
+*
+* Two classes are defined: connected and unconnected. UDP objects are
+* originally unconnected. They can be "connected" to a given address
+* with a call to the setpeername function. The same function can be used to
+* break the connection.
+\*=========================================================================*/
+#include "lua.h"
+
+#include "timeout.h"
+#include "socket.h"
+
+/* can't be larger than wsocket.c MAXCHUNK!!! */
+#define UDP_DATAGRAMSIZE 8192
+
+typedef struct t_udp_ {
+ t_socket sock;
+ t_timeout tm;
+ int family;
+} t_udp;
+typedef t_udp *p_udp;
+
+int udp_open(lua_State *L);
+
+#endif /* UDP_H */
diff --git a/src/unix.c b/src/unix.c
new file mode 100644
index 0000000..91aaaf8
--- /dev/null
+++ b/src/unix.c
@@ -0,0 +1,346 @@
+/*=========================================================================*\
+* Unix domain socket
+* LuaSocket toolkit
+\*=========================================================================*/
+#include
+
+#include "lua.h"
+#include "lauxlib.h"
+
+#include "auxiliar.h"
+#include "socket.h"
+#include "options.h"
+#include "unix.h"
+#include
+
+/*=========================================================================*\
+* Internal function prototypes
+\*=========================================================================*/
+static int global_create(lua_State *L);
+static int meth_connect(lua_State *L);
+static int meth_listen(lua_State *L);
+static int meth_bind(lua_State *L);
+static int meth_send(lua_State *L);
+static int meth_shutdown(lua_State *L);
+static int meth_receive(lua_State *L);
+static int meth_accept(lua_State *L);
+static int meth_close(lua_State *L);
+static int meth_setoption(lua_State *L);
+static int meth_settimeout(lua_State *L);
+static int meth_getfd(lua_State *L);
+static int meth_setfd(lua_State *L);
+static int meth_dirty(lua_State *L);
+static int meth_getstats(lua_State *L);
+static int meth_setstats(lua_State *L);
+
+static const char *unix_tryconnect(p_unix un, const char *path);
+static const char *unix_trybind(p_unix un, const char *path);
+
+/* unix object methods */
+static luaL_Reg unix_methods[] = {
+ {"__gc", meth_close},
+ {"__tostring", auxiliar_tostring},
+ {"accept", meth_accept},
+ {"bind", meth_bind},
+ {"close", meth_close},
+ {"connect", meth_connect},
+ {"dirty", meth_dirty},
+ {"getfd", meth_getfd},
+ {"getstats", meth_getstats},
+ {"setstats", meth_setstats},
+ {"listen", meth_listen},
+ {"receive", meth_receive},
+ {"send", meth_send},
+ {"setfd", meth_setfd},
+ {"setoption", meth_setoption},
+ {"setpeername", meth_connect},
+ {"setsockname", meth_bind},
+ {"settimeout", meth_settimeout},
+ {"shutdown", meth_shutdown},
+ {NULL, NULL}
+};
+
+/* socket option handlers */
+static t_opt optset[] = {
+ {"keepalive", opt_set_keepalive},
+ {"reuseaddr", opt_set_reuseaddr},
+ {"linger", opt_set_linger},
+ {NULL, NULL}
+};
+
+/* our socket creation function */
+/* this is an ad-hoc module that returns a single function
+ * as such, do not include other functions in this array. */
+static luaL_Reg func[] = {
+ {"unix", global_create},
+ {NULL, NULL}
+};
+
+
+/*-------------------------------------------------------------------------*\
+* Initializes module
+\*-------------------------------------------------------------------------*/
+int luaopen_socket_unix(lua_State *L) {
+ /* create classes */
+ auxiliar_newclass(L, "unix{master}", unix_methods);
+ auxiliar_newclass(L, "unix{client}", unix_methods);
+ auxiliar_newclass(L, "unix{server}", unix_methods);
+ /* create class groups */
+ auxiliar_add2group(L, "unix{master}", "unix{any}");
+ auxiliar_add2group(L, "unix{client}", "unix{any}");
+ auxiliar_add2group(L, "unix{server}", "unix{any}");
+#if LUA_VERSION_NUM > 501 && !defined(LUA_COMPAT_MODULE)
+ lua_pushcfunction(L, global_create);
+ (void) func;
+#else
+ /* set function into socket namespace */
+ luaL_openlib(L, "socket", func, 0);
+ lua_pushcfunction(L, global_create);
+#endif
+ /* return the function instead of the 'socket' table */
+ return 1;
+}
+
+/*=========================================================================*\
+* Lua methods
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Just call buffered IO methods
+\*-------------------------------------------------------------------------*/
+static int meth_send(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkclass(L, "unix{client}", 1);
+ return buffer_meth_send(L, &un->buf);
+}
+
+static int meth_receive(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkclass(L, "unix{client}", 1);
+ return buffer_meth_receive(L, &un->buf);
+}
+
+static int meth_getstats(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkclass(L, "unix{client}", 1);
+ return buffer_meth_getstats(L, &un->buf);
+}
+
+static int meth_setstats(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkclass(L, "unix{client}", 1);
+ return buffer_meth_setstats(L, &un->buf);
+}
+
+/*-------------------------------------------------------------------------*\
+* Just call option handler
+\*-------------------------------------------------------------------------*/
+static int meth_setoption(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkgroup(L, "unix{any}", 1);
+ return opt_meth_setoption(L, optset, &un->sock);
+}
+
+/*-------------------------------------------------------------------------*\
+* Select support methods
+\*-------------------------------------------------------------------------*/
+static int meth_getfd(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkgroup(L, "unix{any}", 1);
+ lua_pushnumber(L, (int) un->sock);
+ return 1;
+}
+
+/* this is very dangerous, but can be handy for those that are brave enough */
+static int meth_setfd(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkgroup(L, "unix{any}", 1);
+ un->sock = (t_socket) luaL_checknumber(L, 2);
+ return 0;
+}
+
+static int meth_dirty(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkgroup(L, "unix{any}", 1);
+ lua_pushboolean(L, !buffer_isempty(&un->buf));
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Waits for and returns a client object attempting connection to the
+* server object
+\*-------------------------------------------------------------------------*/
+static int meth_accept(lua_State *L) {
+ p_unix server = (p_unix) auxiliar_checkclass(L, "unix{server}", 1);
+ p_timeout tm = timeout_markstart(&server->tm);
+ t_socket sock;
+ int err = socket_accept(&server->sock, &sock, NULL, NULL, tm);
+ /* if successful, push client socket */
+ if (err == IO_DONE) {
+ p_unix clnt = (p_unix) lua_newuserdata(L, sizeof(t_unix));
+ auxiliar_setclass(L, "unix{client}", -1);
+ /* initialize structure fields */
+ socket_setnonblocking(&sock);
+ clnt->sock = sock;
+ io_init(&clnt->io, (p_send)socket_send, (p_recv)socket_recv,
+ (p_error) socket_ioerror, &clnt->sock);
+ timeout_init(&clnt->tm, -1, -1);
+ buffer_init(&clnt->buf, &clnt->io, &clnt->tm);
+ return 1;
+ } else {
+ lua_pushnil(L);
+ lua_pushstring(L, socket_strerror(err));
+ return 2;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Binds an object to an address
+\*-------------------------------------------------------------------------*/
+static const char *unix_trybind(p_unix un, const char *path) {
+ struct sockaddr_un local;
+ size_t len = strlen(path);
+ int err;
+ if (len >= sizeof(local.sun_path)) return "path too long";
+ memset(&local, 0, sizeof(local));
+ strcpy(local.sun_path, path);
+ local.sun_family = AF_UNIX;
+#ifdef UNIX_HAS_SUN_LEN
+ local.sun_len = sizeof(local.sun_family) + sizeof(local.sun_len)
+ + len + 1;
+ err = socket_bind(&un->sock, (SA *) &local, local.sun_len);
+
+#else
+ err = socket_bind(&un->sock, (SA *) &local,
+ sizeof(local.sun_family) + len);
+#endif
+ if (err != IO_DONE) socket_destroy(&un->sock);
+ return socket_strerror(err);
+}
+
+static int meth_bind(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkclass(L, "unix{master}", 1);
+ const char *path = luaL_checkstring(L, 2);
+ const char *err = unix_trybind(un, path);
+ if (err) {
+ lua_pushnil(L);
+ lua_pushstring(L, err);
+ return 2;
+ }
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Turns a master unix object into a client object.
+\*-------------------------------------------------------------------------*/
+static const char *unix_tryconnect(p_unix un, const char *path)
+{
+ struct sockaddr_un remote;
+ int err;
+ size_t len = strlen(path);
+ if (len >= sizeof(remote.sun_path)) return "path too long";
+ memset(&remote, 0, sizeof(remote));
+ strcpy(remote.sun_path, path);
+ remote.sun_family = AF_UNIX;
+ timeout_markstart(&un->tm);
+#ifdef UNIX_HAS_SUN_LEN
+ remote.sun_len = sizeof(remote.sun_family) + sizeof(remote.sun_len)
+ + len + 1;
+ err = socket_connect(&un->sock, (SA *) &remote, remote.sun_len, &un->tm);
+#else
+ err = socket_connect(&un->sock, (SA *) &remote,
+ sizeof(remote.sun_family) + len, &un->tm);
+#endif
+ if (err != IO_DONE) socket_destroy(&un->sock);
+ return socket_strerror(err);
+}
+
+static int meth_connect(lua_State *L)
+{
+ p_unix un = (p_unix) auxiliar_checkclass(L, "unix{master}", 1);
+ const char *path = luaL_checkstring(L, 2);
+ const char *err = unix_tryconnect(un, path);
+ if (err) {
+ lua_pushnil(L);
+ lua_pushstring(L, err);
+ return 2;
+ }
+ /* turn master object into a client object */
+ auxiliar_setclass(L, "unix{client}", 1);
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Closes socket used by object
+\*-------------------------------------------------------------------------*/
+static int meth_close(lua_State *L)
+{
+ p_unix un = (p_unix) auxiliar_checkgroup(L, "unix{any}", 1);
+ socket_destroy(&un->sock);
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Puts the sockt in listen mode
+\*-------------------------------------------------------------------------*/
+static int meth_listen(lua_State *L)
+{
+ p_unix un = (p_unix) auxiliar_checkclass(L, "unix{master}", 1);
+ int backlog = (int) luaL_optnumber(L, 2, 32);
+ int err = socket_listen(&un->sock, backlog);
+ if (err != IO_DONE) {
+ lua_pushnil(L);
+ lua_pushstring(L, socket_strerror(err));
+ return 2;
+ }
+ /* turn master object into a server object */
+ auxiliar_setclass(L, "unix{server}", 1);
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Shuts the connection down partially
+\*-------------------------------------------------------------------------*/
+static int meth_shutdown(lua_State *L)
+{
+ /* SHUT_RD, SHUT_WR, SHUT_RDWR have the value 0, 1, 2, so we can use method index directly */
+ static const char* methods[] = { "receive", "send", "both", NULL };
+ p_unix tcp = (p_unix) auxiliar_checkclass(L, "unix{client}", 1);
+ int how = luaL_checkoption(L, 2, "both", methods);
+ socket_shutdown(&tcp->sock, how);
+ lua_pushnumber(L, 1);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Just call tm methods
+\*-------------------------------------------------------------------------*/
+static int meth_settimeout(lua_State *L) {
+ p_unix un = (p_unix) auxiliar_checkgroup(L, "unix{any}", 1);
+ return timeout_meth_settimeout(L, &un->tm);
+}
+
+/*=========================================================================*\
+* Library functions
+\*=========================================================================*/
+/*-------------------------------------------------------------------------*\
+* Creates a master unix object
+\*-------------------------------------------------------------------------*/
+static int global_create(lua_State *L) {
+ t_socket sock;
+ int err = socket_create(&sock, AF_UNIX, SOCK_STREAM, 0);
+ /* try to allocate a system socket */
+ if (err == IO_DONE) {
+ /* allocate unix object */
+ p_unix un = (p_unix) lua_newuserdata(L, sizeof(t_unix));
+ /* set its type as master object */
+ auxiliar_setclass(L, "unix{master}", -1);
+ /* initialize remaining structure fields */
+ socket_setnonblocking(&sock);
+ un->sock = sock;
+ io_init(&un->io, (p_send) socket_send, (p_recv) socket_recv,
+ (p_error) socket_ioerror, &un->sock);
+ timeout_init(&un->tm, -1, -1);
+ buffer_init(&un->buf, &un->io, &un->tm);
+ return 1;
+ } else {
+ lua_pushnil(L);
+ lua_pushstring(L, socket_strerror(err));
+ return 2;
+ }
+}
diff --git a/src/unix.h b/src/unix.h
new file mode 100644
index 0000000..3a7e1e6
--- /dev/null
+++ b/src/unix.h
@@ -0,0 +1,26 @@
+#ifndef UNIX_H
+#define UNIX_H
+/*=========================================================================*\
+* Unix domain object
+* LuaSocket toolkit
+*
+* This module is just an example of how to extend LuaSocket with a new
+* domain.
+\*=========================================================================*/
+#include "lua.h"
+
+#include "buffer.h"
+#include "timeout.h"
+#include "socket.h"
+
+typedef struct t_unix_ {
+ t_socket sock;
+ t_io io;
+ t_buffer buf;
+ t_timeout tm;
+} t_unix;
+typedef t_unix *p_unix;
+
+LUASOCKET_API int luaopen_socket_unix(lua_State *L);
+
+#endif /* UNIX_H */
diff --git a/src/url.lua b/src/url.lua
new file mode 100644
index 0000000..3c4f85d
--- /dev/null
+++ b/src/url.lua
@@ -0,0 +1,307 @@
+-----------------------------------------------------------------------------
+-- URI parsing, composition and relative URL resolution
+-- LuaSocket toolkit.
+-- Author: Diego Nehab
+-----------------------------------------------------------------------------
+
+-----------------------------------------------------------------------------
+-- Declare module
+-----------------------------------------------------------------------------
+local string = require("string")
+local base = _G
+local table = require("table")
+local socket = require("socket")
+
+socket.url = {}
+local _M = socket.url
+
+-----------------------------------------------------------------------------
+-- Module version
+-----------------------------------------------------------------------------
+_M._VERSION = "URL 1.0.2"
+
+-----------------------------------------------------------------------------
+-- Encodes a string into its escaped hexadecimal representation
+-- Input
+-- s: binary string to be encoded
+-- Returns
+-- escaped representation of string binary
+-----------------------------------------------------------------------------
+function _M.escape(s)
+ return (string.gsub(s, "([^A-Za-z0-9_])", function(c)
+ return string.format("%%%02x", string.byte(c))
+ end))
+end
+
+-----------------------------------------------------------------------------
+-- Protects a path segment, to prevent it from interfering with the
+-- url parsing.
+-- Input
+-- s: binary string to be encoded
+-- Returns
+-- escaped representation of string binary
+-----------------------------------------------------------------------------
+local function make_set(t)
+ local s = {}
+ for i,v in base.ipairs(t) do
+ s[t[i]] = 1
+ end
+ return s
+end
+
+-- these are allowed withing a path segment, along with alphanum
+-- other characters must be escaped
+local segment_set = make_set {
+ "-", "_", ".", "!", "~", "*", "'", "(",
+ ")", ":", "@", "&", "=", "+", "$", ",",
+}
+
+local function protect_segment(s)
+ return string.gsub(s, "([^A-Za-z0-9_])", function (c)
+ if segment_set[c] then return c
+ else return string.format("%%%02x", string.byte(c)) end
+ end)
+end
+
+-----------------------------------------------------------------------------
+-- Encodes a string into its escaped hexadecimal representation
+-- Input
+-- s: binary string to be encoded
+-- Returns
+-- escaped representation of string binary
+-----------------------------------------------------------------------------
+function _M.unescape(s)
+ return (string.gsub(s, "%%(%x%x)", function(hex)
+ return string.char(base.tonumber(hex, 16))
+ end))
+end
+
+-----------------------------------------------------------------------------
+-- Builds a path from a base path and a relative path
+-- Input
+-- base_path
+-- relative_path
+-- Returns
+-- corresponding absolute path
+-----------------------------------------------------------------------------
+local function absolute_path(base_path, relative_path)
+ if string.sub(relative_path, 1, 1) == "/" then return relative_path end
+ local path = string.gsub(base_path, "[^/]*$", "")
+ path = path .. relative_path
+ path = string.gsub(path, "([^/]*%./)", function (s)
+ if s ~= "./" then return s else return "" end
+ end)
+ path = string.gsub(path, "/%.$", "/")
+ local reduced
+ while reduced ~= path do
+ reduced = path
+ path = string.gsub(reduced, "([^/]*/%.%./)", function (s)
+ if s ~= "../../" then return "" else return s end
+ end)
+ end
+ path = string.gsub(reduced, "([^/]*/%.%.)$", function (s)
+ if s ~= "../.." then return "" else return s end
+ end)
+ return path
+end
+
+-----------------------------------------------------------------------------
+-- Parses a url and returns a table with all its parts according to RFC 2396
+-- The following grammar describes the names given to the URL parts
+-- ::= :///;?#
+-- ::= @:
+-- ::= [:]
+-- :: = {/}
+-- Input
+-- url: uniform resource locator of request
+-- default: table with default values for each field
+-- Returns
+-- table with the following fields, where RFC naming conventions have
+-- been preserved:
+-- scheme, authority, userinfo, user, password, host, port,
+-- path, params, query, fragment
+-- Obs:
+-- the leading '/' in {/} is considered part of
+-----------------------------------------------------------------------------
+function _M.parse(url, default)
+ -- initialize default parameters
+ local parsed = {}
+ for i,v in base.pairs(default or parsed) do parsed[i] = v end
+ -- empty url is parsed to nil
+ if not url or url == "" then return nil, "invalid url" end
+ -- remove whitespace
+ -- url = string.gsub(url, "%s", "")
+ -- get fragment
+ url = string.gsub(url, "#(.*)$", function(f)
+ parsed.fragment = f
+ return ""
+ end)
+ -- get scheme
+ url = string.gsub(url, "^([%w][%w%+%-%.]*)%:",
+ function(s) parsed.scheme = s; return "" end)
+ -- get authority
+ url = string.gsub(url, "^//([^/]*)", function(n)
+ parsed.authority = n
+ return ""
+ end)
+ -- get query string
+ url = string.gsub(url, "%?(.*)", function(q)
+ parsed.query = q
+ return ""
+ end)
+ -- get params
+ url = string.gsub(url, "%;(.*)", function(p)
+ parsed.params = p
+ return ""
+ end)
+ -- path is whatever was left
+ if url ~= "" then parsed.path = url end
+ local authority = parsed.authority
+ if not authority then return parsed end
+ authority = string.gsub(authority,"^([^@]*)@",
+ function(u) parsed.userinfo = u; return "" end)
+ authority = string.gsub(authority, ":([^:%]]*)$",
+ function(p) parsed.port = p; return "" end)
+ if authority ~= "" then
+ -- IPv6?
+ parsed.host = string.match(authority, "^%[(.+)%]$") or authority
+ end
+ local userinfo = parsed.userinfo
+ if not userinfo then return parsed end
+ userinfo = string.gsub(userinfo, ":([^:]*)$",
+ function(p) parsed.password = p; return "" end)
+ parsed.user = userinfo
+ return parsed
+end
+
+-----------------------------------------------------------------------------
+-- Rebuilds a parsed URL from its components.
+-- Components are protected if any reserved or unallowed characters are found
+-- Input
+-- parsed: parsed URL, as returned by parse
+-- Returns
+-- a stringing with the corresponding URL
+-----------------------------------------------------------------------------
+function _M.build(parsed)
+ local ppath = _M.parse_path(parsed.path or "")
+ local url = _M.build_path(ppath)
+ if parsed.params then url = url .. ";" .. parsed.params end
+ if parsed.query then url = url .. "?" .. parsed.query end
+ local authority = parsed.authority
+ if parsed.host then
+ authority = parsed.host
+ if string.find(authority, ":") then -- IPv6?
+ authority = "[" .. authority .. "]"
+ end
+ if parsed.port then authority = authority .. ":" .. parsed.port end
+ local userinfo = parsed.userinfo
+ if parsed.user then
+ userinfo = parsed.user
+ if parsed.password then
+ userinfo = userinfo .. ":" .. parsed.password
+ end
+ end
+ if userinfo then authority = userinfo .. "@" .. authority end
+ end
+ if authority then url = "//" .. authority .. url end
+ if parsed.scheme then url = parsed.scheme .. ":" .. url end
+ if parsed.fragment then url = url .. "#" .. parsed.fragment end
+ -- url = string.gsub(url, "%s", "")
+ return url
+end
+
+-----------------------------------------------------------------------------
+-- Builds a absolute URL from a base and a relative URL according to RFC 2396
+-- Input
+-- base_url
+-- relative_url
+-- Returns
+-- corresponding absolute url
+-----------------------------------------------------------------------------
+function _M.absolute(base_url, relative_url)
+ if base.type(base_url) == "table" then
+ base_parsed = base_url
+ base_url = _M.build(base_parsed)
+ else
+ base_parsed = _M.parse(base_url)
+ end
+ local relative_parsed = _M.parse(relative_url)
+ if not base_parsed then return relative_url
+ elseif not relative_parsed then return base_url
+ elseif relative_parsed.scheme then return relative_url
+ else
+ relative_parsed.scheme = base_parsed.scheme
+ if not relative_parsed.authority then
+ relative_parsed.authority = base_parsed.authority
+ if not relative_parsed.path then
+ relative_parsed.path = base_parsed.path
+ if not relative_parsed.params then
+ relative_parsed.params = base_parsed.params
+ if not relative_parsed.query then
+ relative_parsed.query = base_parsed.query
+ end
+ end
+ else
+ relative_parsed.path = absolute_path(base_parsed.path or "",
+ relative_parsed.path)
+ end
+ end
+ return _M.build(relative_parsed)
+ end
+end
+
+-----------------------------------------------------------------------------
+-- Breaks a path into its segments, unescaping the segments
+-- Input
+-- path
+-- Returns
+-- segment: a table with one entry per segment
+-----------------------------------------------------------------------------
+function _M.parse_path(path)
+ local parsed = {}
+ path = path or ""
+ --path = string.gsub(path, "%s", "")
+ string.gsub(path, "([^/]+)", function (s) table.insert(parsed, s) end)
+ for i = 1, #parsed do
+ parsed[i] = _M.unescape(parsed[i])
+ end
+ if string.sub(path, 1, 1) == "/" then parsed.is_absolute = 1 end
+ if string.sub(path, -1, -1) == "/" then parsed.is_directory = 1 end
+ return parsed
+end
+
+-----------------------------------------------------------------------------
+-- Builds a path component from its segments, escaping protected characters.
+-- Input
+-- parsed: path segments
+-- unsafe: if true, segments are not protected before path is built
+-- Returns
+-- path: corresponding path stringing
+-----------------------------------------------------------------------------
+function _M.build_path(parsed, unsafe)
+ local path = ""
+ local n = #parsed
+ if unsafe then
+ for i = 1, n-1 do
+ path = path .. parsed[i]
+ path = path .. "/"
+ end
+ if n > 0 then
+ path = path .. parsed[n]
+ if parsed.is_directory then path = path .. "/" end
+ end
+ else
+ for i = 1, n-1 do
+ path = path .. protect_segment(parsed[i])
+ path = path .. "/"
+ end
+ if n > 0 then
+ path = path .. protect_segment(parsed[n])
+ if parsed.is_directory then path = path .. "/" end
+ end
+ end
+ if parsed.is_absolute then path = "/" .. path end
+ return path
+end
+
+return _M
\ No newline at end of file
diff --git a/src/usocket.c b/src/usocket.c
new file mode 100644
index 0000000..096ecd0
--- /dev/null
+++ b/src/usocket.c
@@ -0,0 +1,449 @@
+/*=========================================================================*\
+* Socket compatibilization module for Unix
+* LuaSocket toolkit
+*
+* The code is now interrupt-safe.
+* The penalty of calling select to avoid busy-wait is only paid when
+* the I/O call fail in the first place.
+\*=========================================================================*/
+#include
+#include
+
+#include "socket.h"
+
+/*-------------------------------------------------------------------------*\
+* Wait for readable/writable/connected socket with timeout
+\*-------------------------------------------------------------------------*/
+#ifndef SOCKET_SELECT
+#include
+
+#define WAITFD_R POLLIN
+#define WAITFD_W POLLOUT
+#define WAITFD_C (POLLIN|POLLOUT)
+int socket_waitfd(p_socket ps, int sw, p_timeout tm) {
+ int ret;
+ struct pollfd pfd;
+ pfd.fd = *ps;
+ pfd.events = sw;
+ pfd.revents = 0;
+ if (timeout_iszero(tm)) return IO_TIMEOUT; /* optimize timeout == 0 case */
+ do {
+ int t = (int)(timeout_getretry(tm)*1e3);
+ ret = poll(&pfd, 1, t >= 0? t: -1);
+ } while (ret == -1 && errno == EINTR);
+ if (ret == -1) return errno;
+ if (ret == 0) return IO_TIMEOUT;
+ if (sw == WAITFD_C && (pfd.revents & (POLLIN|POLLERR))) return IO_CLOSED;
+ return IO_DONE;
+}
+#else
+
+#define WAITFD_R 1
+#define WAITFD_W 2
+#define WAITFD_C (WAITFD_R|WAITFD_W)
+
+int socket_waitfd(p_socket ps, int sw, p_timeout tm) {
+ int ret;
+ fd_set rfds, wfds, *rp, *wp;
+ struct timeval tv, *tp;
+ double t;
+ if (*ps >= FD_SETSIZE) return EINVAL;
+ if (timeout_iszero(tm)) return IO_TIMEOUT; /* optimize timeout == 0 case */
+ do {
+ /* must set bits within loop, because select may have modifed them */
+ rp = wp = NULL;
+ if (sw & WAITFD_R) { FD_ZERO(&rfds); FD_SET(*ps, &rfds); rp = &rfds; }
+ if (sw & WAITFD_W) { FD_ZERO(&wfds); FD_SET(*ps, &wfds); wp = &wfds; }
+ t = timeout_getretry(tm);
+ tp = NULL;
+ if (t >= 0.0) {
+ tv.tv_sec = (int)t;
+ tv.tv_usec = (int)((t-tv.tv_sec)*1.0e6);
+ tp = &tv;
+ }
+ ret = select(*ps+1, rp, wp, NULL, tp);
+ } while (ret == -1 && errno == EINTR);
+ if (ret == -1) return errno;
+ if (ret == 0) return IO_TIMEOUT;
+ if (sw == WAITFD_C && FD_ISSET(*ps, &rfds)) return IO_CLOSED;
+ return IO_DONE;
+}
+#endif
+
+
+/*-------------------------------------------------------------------------*\
+* Initializes module
+\*-------------------------------------------------------------------------*/
+int socket_open(void) {
+ /* instals a handler to ignore sigpipe or it will crash us */
+ signal(SIGPIPE, SIG_IGN);
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Close module
+\*-------------------------------------------------------------------------*/
+int socket_close(void) {
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Close and inutilize socket
+\*-------------------------------------------------------------------------*/
+void socket_destroy(p_socket ps) {
+ if (*ps != SOCKET_INVALID) {
+ socket_setblocking(ps);
+ close(*ps);
+ *ps = SOCKET_INVALID;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Select with timeout control
+\*-------------------------------------------------------------------------*/
+int socket_select(t_socket n, fd_set *rfds, fd_set *wfds, fd_set *efds,
+ p_timeout tm) {
+ int ret;
+ do {
+ struct timeval tv;
+ double t = timeout_getretry(tm);
+ tv.tv_sec = (int) t;
+ tv.tv_usec = (int) ((t - tv.tv_sec) * 1.0e6);
+ /* timeout = 0 means no wait */
+ ret = select(n, rfds, wfds, efds, t >= 0.0 ? &tv: NULL);
+ } while (ret < 0 && errno == EINTR);
+ return ret;
+}
+
+/*-------------------------------------------------------------------------*\
+* Creates and sets up a socket
+\*-------------------------------------------------------------------------*/
+int socket_create(p_socket ps, int domain, int type, int protocol) {
+ *ps = socket(domain, type, protocol);
+ if (*ps != SOCKET_INVALID) return IO_DONE;
+ else return errno;
+}
+
+/*-------------------------------------------------------------------------*\
+* Binds or returns error message
+\*-------------------------------------------------------------------------*/
+int socket_bind(p_socket ps, SA *addr, socklen_t len) {
+ int err = IO_DONE;
+ socket_setblocking(ps);
+ if (bind(*ps, addr, len) < 0) err = errno;
+ socket_setnonblocking(ps);
+ return err;
+}
+
+/*-------------------------------------------------------------------------*\
+*
+\*-------------------------------------------------------------------------*/
+int socket_listen(p_socket ps, int backlog) {
+ int err = IO_DONE;
+ socket_setblocking(ps);
+ if (listen(*ps, backlog)) err = errno;
+ socket_setnonblocking(ps);
+ return err;
+}
+
+/*-------------------------------------------------------------------------*\
+*
+\*-------------------------------------------------------------------------*/
+void socket_shutdown(p_socket ps, int how) {
+ socket_setblocking(ps);
+ shutdown(*ps, how);
+ socket_setnonblocking(ps);
+}
+
+/*-------------------------------------------------------------------------*\
+* Connects or returns error message
+\*-------------------------------------------------------------------------*/
+int socket_connect(p_socket ps, SA *addr, socklen_t len, p_timeout tm) {
+ int err;
+ /* avoid calling on closed sockets */
+ if (*ps == SOCKET_INVALID) return IO_CLOSED;
+ /* call connect until done or failed without being interrupted */
+ do if (connect(*ps, addr, len) == 0) return IO_DONE;
+ while ((err = errno) == EINTR);
+ /* if connection failed immediately, return error code */
+ if (err != EINPROGRESS && err != EAGAIN) return err;
+ /* zero timeout case optimization */
+ if (timeout_iszero(tm)) return IO_TIMEOUT;
+ /* wait until we have the result of the connection attempt or timeout */
+ err = socket_waitfd(ps, WAITFD_C, tm);
+ if (err == IO_CLOSED) {
+ if (recv(*ps, (char *) &err, 0, 0) == 0) return IO_DONE;
+ else return errno;
+ } else return err;
+}
+
+/*-------------------------------------------------------------------------*\
+* Accept with timeout
+\*-------------------------------------------------------------------------*/
+int socket_accept(p_socket ps, p_socket pa, SA *addr, socklen_t *len, p_timeout tm) {
+ if (*ps == SOCKET_INVALID) return IO_CLOSED;
+ for ( ;; ) {
+ int err;
+ if ((*pa = accept(*ps, addr, len)) != SOCKET_INVALID) return IO_DONE;
+ err = errno;
+ if (err == EINTR) continue;
+ if (err != EAGAIN && err != ECONNABORTED) return err;
+ if ((err = socket_waitfd(ps, WAITFD_R, tm)) != IO_DONE) return err;
+ }
+ /* can't reach here */
+ return IO_UNKNOWN;
+}
+
+/*-------------------------------------------------------------------------*\
+* Send with timeout
+\*-------------------------------------------------------------------------*/
+int socket_send(p_socket ps, const char *data, size_t count,
+ size_t *sent, p_timeout tm)
+{
+ int err;
+ *sent = 0;
+ /* avoid making system calls on closed sockets */
+ if (*ps == SOCKET_INVALID) return IO_CLOSED;
+ /* loop until we send something or we give up on error */
+ for ( ;; ) {
+ long put = (long) send(*ps, data, count, 0);
+ /* if we sent anything, we are done */
+ if (put >= 0) {
+ *sent = put;
+ return IO_DONE;
+ }
+ err = errno;
+ /* EPIPE means the connection was closed */
+ if (err == EPIPE) return IO_CLOSED;
+ /* we call was interrupted, just try again */
+ if (err == EINTR) continue;
+ /* if failed fatal reason, report error */
+ if (err != EAGAIN) return err;
+ /* wait until we can send something or we timeout */
+ if ((err = socket_waitfd(ps, WAITFD_W, tm)) != IO_DONE) return err;
+ }
+ /* can't reach here */
+ return IO_UNKNOWN;
+}
+
+/*-------------------------------------------------------------------------*\
+* Sendto with timeout
+\*-------------------------------------------------------------------------*/
+int socket_sendto(p_socket ps, const char *data, size_t count, size_t *sent,
+ SA *addr, socklen_t len, p_timeout tm)
+{
+ int err;
+ *sent = 0;
+ if (*ps == SOCKET_INVALID) return IO_CLOSED;
+ for ( ;; ) {
+ long put = (long) sendto(*ps, data, count, 0, addr, len);
+ if (put >= 0) {
+ *sent = put;
+ return IO_DONE;
+ }
+ err = errno;
+ if (err == EPIPE) return IO_CLOSED;
+ if (err == EINTR) continue;
+ if (err != EAGAIN) return err;
+ if ((err = socket_waitfd(ps, WAITFD_W, tm)) != IO_DONE) return err;
+ }
+ return IO_UNKNOWN;
+}
+
+/*-------------------------------------------------------------------------*\
+* Receive with timeout
+\*-------------------------------------------------------------------------*/
+int socket_recv(p_socket ps, char *data, size_t count, size_t *got, p_timeout tm) {
+ int err;
+ *got = 0;
+ if (*ps == SOCKET_INVALID) return IO_CLOSED;
+ for ( ;; ) {
+ long taken = (long) recv(*ps, data, count, 0);
+ if (taken > 0) {
+ *got = taken;
+ return IO_DONE;
+ }
+ err = errno;
+ if (taken == 0) return IO_CLOSED;
+ if (err == EINTR) continue;
+ if (err != EAGAIN) return err;
+ if ((err = socket_waitfd(ps, WAITFD_R, tm)) != IO_DONE) return err;
+ }
+ return IO_UNKNOWN;
+}
+
+/*-------------------------------------------------------------------------*\
+* Recvfrom with timeout
+\*-------------------------------------------------------------------------*/
+int socket_recvfrom(p_socket ps, char *data, size_t count, size_t *got,
+ SA *addr, socklen_t *len, p_timeout tm) {
+ int err;
+ *got = 0;
+ if (*ps == SOCKET_INVALID) return IO_CLOSED;
+ for ( ;; ) {
+ long taken = (long) recvfrom(*ps, data, count, 0, addr, len);
+ if (taken > 0) {
+ *got = taken;
+ return IO_DONE;
+ }
+ err = errno;
+ if (taken == 0) return IO_CLOSED;
+ if (err == EINTR) continue;
+ if (err != EAGAIN) return err;
+ if ((err = socket_waitfd(ps, WAITFD_R, tm)) != IO_DONE) return err;
+ }
+ return IO_UNKNOWN;
+}
+
+
+/*-------------------------------------------------------------------------*\
+* Write with timeout
+*
+* socket_read and socket_write are cut-n-paste of socket_send and socket_recv,
+* with send/recv replaced with write/read. We can't just use write/read
+* in the socket version, because behaviour when size is zero is different.
+\*-------------------------------------------------------------------------*/
+int socket_write(p_socket ps, const char *data, size_t count,
+ size_t *sent, p_timeout tm)
+{
+ int err;
+ *sent = 0;
+ /* avoid making system calls on closed sockets */
+ if (*ps == SOCKET_INVALID) return IO_CLOSED;
+ /* loop until we send something or we give up on error */
+ for ( ;; ) {
+ long put = (long) write(*ps, data, count);
+ /* if we sent anything, we are done */
+ if (put >= 0) {
+ *sent = put;
+ return IO_DONE;
+ }
+ err = errno;
+ /* EPIPE means the connection was closed */
+ if (err == EPIPE) return IO_CLOSED;
+ /* we call was interrupted, just try again */
+ if (err == EINTR) continue;
+ /* if failed fatal reason, report error */
+ if (err != EAGAIN) return err;
+ /* wait until we can send something or we timeout */
+ if ((err = socket_waitfd(ps, WAITFD_W, tm)) != IO_DONE) return err;
+ }
+ /* can't reach here */
+ return IO_UNKNOWN;
+}
+
+/*-------------------------------------------------------------------------*\
+* Read with timeout
+* See note for socket_write
+\*-------------------------------------------------------------------------*/
+int socket_read(p_socket ps, char *data, size_t count, size_t *got, p_timeout tm) {
+ int err;
+ *got = 0;
+ if (*ps == SOCKET_INVALID) return IO_CLOSED;
+ for ( ;; ) {
+ long taken = (long) read(*ps, data, count);
+ if (taken > 0) {
+ *got = taken;
+ return IO_DONE;
+ }
+ err = errno;
+ if (taken == 0) return IO_CLOSED;
+ if (err == EINTR) continue;
+ if (err != EAGAIN) return err;
+ if ((err = socket_waitfd(ps, WAITFD_R, tm)) != IO_DONE) return err;
+ }
+ return IO_UNKNOWN;
+}
+
+/*-------------------------------------------------------------------------*\
+* Put socket into blocking mode
+\*-------------------------------------------------------------------------*/
+void socket_setblocking(p_socket ps) {
+ int flags = fcntl(*ps, F_GETFL, 0);
+ flags &= (~(O_NONBLOCK));
+ fcntl(*ps, F_SETFL, flags);
+}
+
+/*-------------------------------------------------------------------------*\
+* Put socket into non-blocking mode
+\*-------------------------------------------------------------------------*/
+void socket_setnonblocking(p_socket ps) {
+ int flags = fcntl(*ps, F_GETFL, 0);
+ flags |= O_NONBLOCK;
+ fcntl(*ps, F_SETFL, flags);
+}
+
+/*-------------------------------------------------------------------------*\
+* DNS helpers
+\*-------------------------------------------------------------------------*/
+int socket_gethostbyaddr(const char *addr, socklen_t len, struct hostent **hp) {
+ *hp = gethostbyaddr(addr, len, AF_INET);
+ if (*hp) return IO_DONE;
+ else if (h_errno) return h_errno;
+ else if (errno) return errno;
+ else return IO_UNKNOWN;
+}
+
+int socket_gethostbyname(const char *addr, struct hostent **hp) {
+ *hp = gethostbyname(addr);
+ if (*hp) return IO_DONE;
+ else if (h_errno) return h_errno;
+ else if (errno) return errno;
+ else return IO_UNKNOWN;
+}
+
+/*-------------------------------------------------------------------------*\
+* Error translation functions
+* Make sure important error messages are standard
+\*-------------------------------------------------------------------------*/
+const char *socket_hoststrerror(int err) {
+ if (err <= 0) return io_strerror(err);
+ switch (err) {
+ case HOST_NOT_FOUND: return "host not found";
+ default: return hstrerror(err);
+ }
+}
+
+const char *socket_strerror(int err) {
+ if (err <= 0) return io_strerror(err);
+ switch (err) {
+ case EADDRINUSE: return "address already in use";
+ case EISCONN: return "already connected";
+ case EACCES: return "permission denied";
+ case ECONNREFUSED: return "connection refused";
+ case ECONNABORTED: return "closed";
+ case ECONNRESET: return "closed";
+ case ETIMEDOUT: return "timeout";
+ default: return strerror(err);
+ }
+}
+
+const char *socket_ioerror(p_socket ps, int err) {
+ (void) ps;
+ return socket_strerror(err);
+}
+
+const char *socket_gaistrerror(int err) {
+ if (err == 0) return NULL;
+ switch (err) {
+ case EAI_AGAIN: return "temporary failure in name resolution";
+ case EAI_BADFLAGS: return "invalid value for ai_flags";
+#ifdef EAI_BADHINTS
+ case EAI_BADHINTS: return "invalid value for hints";
+#endif
+ case EAI_FAIL: return "non-recoverable failure in name resolution";
+ case EAI_FAMILY: return "ai_family not supported";
+ case EAI_MEMORY: return "memory allocation failure";
+ case EAI_NONAME:
+ return "host or service not provided, or not known";
+ case EAI_OVERFLOW: return "argument buffer overflow";
+#ifdef EAI_PROTOCOL
+ case EAI_PROTOCOL: return "resolved protocol is unknown";
+#endif
+ case EAI_SERVICE: return "service not supported for socket type";
+ case EAI_SOCKTYPE: return "ai_socktype not supported";
+ case EAI_SYSTEM: return strerror(errno);
+ default: return gai_strerror(err);
+ }
+}
+
diff --git a/src/usocket.h b/src/usocket.h
new file mode 100644
index 0000000..45f2f99
--- /dev/null
+++ b/src/usocket.h
@@ -0,0 +1,59 @@
+#ifndef USOCKET_H
+#define USOCKET_H
+/*=========================================================================*\
+* Socket compatibilization module for Unix
+* LuaSocket toolkit
+\*=========================================================================*/
+
+/*=========================================================================*\
+* BSD include files
+\*=========================================================================*/
+/* error codes */
+#include
+/* close function */
+#include
+/* fnctnl function and associated constants */
+#include
+/* struct sockaddr */
+#include
+/* socket function */
+#include
+/* struct timeval */
+#include
+/* gethostbyname and gethostbyaddr functions */
+#include
+/* sigpipe handling */
+#include
+/* IP stuff*/
+#include
+#include
+/* TCP options (nagle algorithm disable) */
+#include
+#include
+
+#ifndef SO_REUSEPORT
+#define SO_REUSEPORT SO_REUSEADDR
+#endif
+
+/* Some platforms use IPV6_JOIN_GROUP instead if
+ * IPV6_ADD_MEMBERSHIP. The semantics are same, though. */
+#ifndef IPV6_ADD_MEMBERSHIP
+#ifdef IPV6_JOIN_GROUP
+#define IPV6_ADD_MEMBERSHIP IPV6_JOIN_GROUP
+#endif /* IPV6_JOIN_GROUP */
+#endif /* !IPV6_ADD_MEMBERSHIP */
+
+/* Same with IPV6_DROP_MEMBERSHIP / IPV6_LEAVE_GROUP. */
+#ifndef IPV6_DROP_MEMBERSHIP
+#ifdef IPV6_LEAVE_GROUP
+#define IPV6_DROP_MEMBERSHIP IPV6_LEAVE_GROUP
+#endif /* IPV6_LEAVE_GROUP */
+#endif /* !IPV6_DROP_MEMBERSHIP */
+
+typedef int t_socket;
+typedef t_socket *p_socket;
+typedef struct sockaddr_storage t_sockaddr_storage;
+
+#define SOCKET_INVALID (-1)
+
+#endif /* USOCKET_H */
diff --git a/src/wsocket.c b/src/wsocket.c
new file mode 100644
index 0000000..b4a4384
--- /dev/null
+++ b/src/wsocket.c
@@ -0,0 +1,434 @@
+/*=========================================================================*\
+* Socket compatibilization module for Win32
+* LuaSocket toolkit
+*
+* The penalty of calling select to avoid busy-wait is only paid when
+* the I/O call fail in the first place.
+\*=========================================================================*/
+#include
+
+#include "socket.h"
+
+/* WinSock doesn't have a strerror... */
+static const char *wstrerror(int err);
+
+/*-------------------------------------------------------------------------*\
+* Initializes module
+\*-------------------------------------------------------------------------*/
+int socket_open(void) {
+ WSADATA wsaData;
+ WORD wVersionRequested = MAKEWORD(2, 0);
+ int err = WSAStartup(wVersionRequested, &wsaData );
+ if (err != 0) return 0;
+ if ((LOBYTE(wsaData.wVersion) != 2 || HIBYTE(wsaData.wVersion) != 0) &&
+ (LOBYTE(wsaData.wVersion) != 1 || HIBYTE(wsaData.wVersion) != 1)) {
+ WSACleanup();
+ return 0;
+ }
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Close module
+\*-------------------------------------------------------------------------*/
+int socket_close(void) {
+ WSACleanup();
+ return 1;
+}
+
+/*-------------------------------------------------------------------------*\
+* Wait for readable/writable/connected socket with timeout
+\*-------------------------------------------------------------------------*/
+#define WAITFD_R 1
+#define WAITFD_W 2
+#define WAITFD_E 4
+#define WAITFD_C (WAITFD_E|WAITFD_W)
+
+int socket_waitfd(p_socket ps, int sw, p_timeout tm) {
+ int ret;
+ fd_set rfds, wfds, efds, *rp = NULL, *wp = NULL, *ep = NULL;
+ struct timeval tv, *tp = NULL;
+ double t;
+ if (timeout_iszero(tm)) return IO_TIMEOUT; /* optimize timeout == 0 case */
+ if (sw & WAITFD_R) {
+ FD_ZERO(&rfds);
+ FD_SET(*ps, &rfds);
+ rp = &rfds;
+ }
+ if (sw & WAITFD_W) { FD_ZERO(&wfds); FD_SET(*ps, &wfds); wp = &wfds; }
+ if (sw & WAITFD_C) { FD_ZERO(&efds); FD_SET(*ps, &efds); ep = &efds; }
+ if ((t = timeout_get(tm)) >= 0.0) {
+ tv.tv_sec = (int) t;
+ tv.tv_usec = (int) ((t-tv.tv_sec)*1.0e6);
+ tp = &tv;
+ }
+ ret = select(0, rp, wp, ep, tp);
+ if (ret == -1) return WSAGetLastError();
+ if (ret == 0) return IO_TIMEOUT;
+ if (sw == WAITFD_C && FD_ISSET(*ps, &efds)) return IO_CLOSED;
+ return IO_DONE;
+}
+
+/*-------------------------------------------------------------------------*\
+* Select with int timeout in ms
+\*-------------------------------------------------------------------------*/
+int socket_select(t_socket n, fd_set *rfds, fd_set *wfds, fd_set *efds,
+ p_timeout tm) {
+ struct timeval tv;
+ double t = timeout_get(tm);
+ tv.tv_sec = (int) t;
+ tv.tv_usec = (int) ((t - tv.tv_sec) * 1.0e6);
+ if (n <= 0) {
+ Sleep((DWORD) (1000*t));
+ return 0;
+ } else return select(0, rfds, wfds, efds, t >= 0.0? &tv: NULL);
+}
+
+/*-------------------------------------------------------------------------*\
+* Close and inutilize socket
+\*-------------------------------------------------------------------------*/
+void socket_destroy(p_socket ps) {
+ if (*ps != SOCKET_INVALID) {
+ socket_setblocking(ps); /* close can take a long time on WIN32 */
+ closesocket(*ps);
+ *ps = SOCKET_INVALID;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+*
+\*-------------------------------------------------------------------------*/
+void socket_shutdown(p_socket ps, int how) {
+ socket_setblocking(ps);
+ shutdown(*ps, how);
+ socket_setnonblocking(ps);
+}
+
+/*-------------------------------------------------------------------------*\
+* Creates and sets up a socket
+\*-------------------------------------------------------------------------*/
+int socket_create(p_socket ps, int domain, int type, int protocol) {
+ *ps = socket(domain, type, protocol);
+ if (*ps != SOCKET_INVALID) return IO_DONE;
+ else return WSAGetLastError();
+}
+
+/*-------------------------------------------------------------------------*\
+* Connects or returns error message
+\*-------------------------------------------------------------------------*/
+int socket_connect(p_socket ps, SA *addr, socklen_t len, p_timeout tm) {
+ int err;
+ /* don't call on closed socket */
+ if (*ps == SOCKET_INVALID) return IO_CLOSED;
+ /* ask system to connect */
+ if (connect(*ps, addr, len) == 0) return IO_DONE;
+ /* make sure the system is trying to connect */
+ err = WSAGetLastError();
+ if (err != WSAEWOULDBLOCK && err != WSAEINPROGRESS) return err;
+ /* zero timeout case optimization */
+ if (timeout_iszero(tm)) return IO_TIMEOUT;
+ /* we wait until something happens */
+ err = socket_waitfd(ps, WAITFD_C, tm);
+ if (err == IO_CLOSED) {
+ int len = sizeof(err);
+ /* give windows time to set the error (yes, disgusting) */
+ Sleep(10);
+ /* find out why we failed */
+ getsockopt(*ps, SOL_SOCKET, SO_ERROR, (char *)&err, &len);
+ /* we KNOW there was an error. if 'why' is 0, we will return
+ * "unknown error", but it's not really our fault */
+ return err > 0? err: IO_UNKNOWN;
+ } else return err;
+
+}
+
+/*-------------------------------------------------------------------------*\
+* Binds or returns error message
+\*-------------------------------------------------------------------------*/
+int socket_bind(p_socket ps, SA *addr, socklen_t len) {
+ int err = IO_DONE;
+ socket_setblocking(ps);
+ if (bind(*ps, addr, len) < 0) err = WSAGetLastError();
+ socket_setnonblocking(ps);
+ return err;
+}
+
+/*-------------------------------------------------------------------------*\
+*
+\*-------------------------------------------------------------------------*/
+int socket_listen(p_socket ps, int backlog) {
+ int err = IO_DONE;
+ socket_setblocking(ps);
+ if (listen(*ps, backlog) < 0) err = WSAGetLastError();
+ socket_setnonblocking(ps);
+ return err;
+}
+
+/*-------------------------------------------------------------------------*\
+* Accept with timeout
+\*-------------------------------------------------------------------------*/
+int socket_accept(p_socket ps, p_socket pa, SA *addr, socklen_t *len,
+ p_timeout tm) {
+ if (*ps == SOCKET_INVALID) return IO_CLOSED;
+ for ( ;; ) {
+ int err;
+ /* try to get client socket */
+ if ((*pa = accept(*ps, addr, len)) != SOCKET_INVALID) return IO_DONE;
+ /* find out why we failed */
+ err = WSAGetLastError();
+ /* if we failed because there was no connectoin, keep trying */
+ if (err != WSAEWOULDBLOCK && err != WSAECONNABORTED) return err;
+ /* call select to avoid busy wait */
+ if ((err = socket_waitfd(ps, WAITFD_R, tm)) != IO_DONE) return err;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Send with timeout
+* On windows, if you try to send 10MB, the OS will buffer EVERYTHING
+* this can take an awful lot of time and we will end up blocked.
+* Therefore, whoever calls this function should not pass a huge buffer.
+\*-------------------------------------------------------------------------*/
+int socket_send(p_socket ps, const char *data, size_t count,
+ size_t *sent, p_timeout tm)
+{
+ int err;
+ *sent = 0;
+ /* avoid making system calls on closed sockets */
+ if (*ps == SOCKET_INVALID) return IO_CLOSED;
+ /* loop until we send something or we give up on error */
+ for ( ;; ) {
+ /* try to send something */
+ int put = send(*ps, data, (int) count, 0);
+ /* if we sent something, we are done */
+ if (put > 0) {
+ *sent = put;
+ return IO_DONE;
+ }
+ /* deal with failure */
+ err = WSAGetLastError();
+ /* we can only proceed if there was no serious error */
+ if (err != WSAEWOULDBLOCK) return err;
+ /* avoid busy wait */
+ if ((err = socket_waitfd(ps, WAITFD_W, tm)) != IO_DONE) return err;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Sendto with timeout
+\*-------------------------------------------------------------------------*/
+int socket_sendto(p_socket ps, const char *data, size_t count, size_t *sent,
+ SA *addr, socklen_t len, p_timeout tm)
+{
+ int err;
+ *sent = 0;
+ if (*ps == SOCKET_INVALID) return IO_CLOSED;
+ for ( ;; ) {
+ int put = sendto(*ps, data, (int) count, 0, addr, len);
+ if (put > 0) {
+ *sent = put;
+ return IO_DONE;
+ }
+ err = WSAGetLastError();
+ if (err != WSAEWOULDBLOCK) return err;
+ if ((err = socket_waitfd(ps, WAITFD_W, tm)) != IO_DONE) return err;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Receive with timeout
+\*-------------------------------------------------------------------------*/
+int socket_recv(p_socket ps, char *data, size_t count, size_t *got,
+ p_timeout tm)
+{
+ int err, prev = IO_DONE;
+ *got = 0;
+ if (*ps == SOCKET_INVALID) return IO_CLOSED;
+ for ( ;; ) {
+ int taken = recv(*ps, data, (int) count, 0);
+ if (taken > 0) {
+ *got = taken;
+ return IO_DONE;
+ }
+ if (taken == 0) return IO_CLOSED;
+ err = WSAGetLastError();
+ /* On UDP, a connreset simply means the previous send failed.
+ * So we try again.
+ * On TCP, it means our socket is now useless, so the error passes.
+ * (We will loop again, exiting because the same error will happen) */
+ if (err != WSAEWOULDBLOCK) {
+ if (err != WSAECONNRESET || prev == WSAECONNRESET) return err;
+ prev = err;
+ }
+ if ((err = socket_waitfd(ps, WAITFD_R, tm)) != IO_DONE) return err;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Recvfrom with timeout
+\*-------------------------------------------------------------------------*/
+int socket_recvfrom(p_socket ps, char *data, size_t count, size_t *got,
+ SA *addr, socklen_t *len, p_timeout tm)
+{
+ int err, prev = IO_DONE;
+ *got = 0;
+ if (*ps == SOCKET_INVALID) return IO_CLOSED;
+ for ( ;; ) {
+ int taken = recvfrom(*ps, data, (int) count, 0, addr, len);
+ if (taken > 0) {
+ *got = taken;
+ return IO_DONE;
+ }
+ if (taken == 0) return IO_CLOSED;
+ err = WSAGetLastError();
+ /* On UDP, a connreset simply means the previous send failed.
+ * So we try again.
+ * On TCP, it means our socket is now useless, so the error passes.
+ * (We will loop again, exiting because the same error will happen) */
+ if (err != WSAEWOULDBLOCK) {
+ if (err != WSAECONNRESET || prev == WSAECONNRESET) return err;
+ prev = err;
+ }
+ if ((err = socket_waitfd(ps, WAITFD_R, tm)) != IO_DONE) return err;
+ }
+}
+
+/*-------------------------------------------------------------------------*\
+* Put socket into blocking mode
+\*-------------------------------------------------------------------------*/
+void socket_setblocking(p_socket ps) {
+ u_long argp = 0;
+ ioctlsocket(*ps, FIONBIO, &argp);
+}
+
+/*-------------------------------------------------------------------------*\
+* Put socket into non-blocking mode
+\*-------------------------------------------------------------------------*/
+void socket_setnonblocking(p_socket ps) {
+ u_long argp = 1;
+ ioctlsocket(*ps, FIONBIO, &argp);
+}
+
+/*-------------------------------------------------------------------------*\
+* DNS helpers
+\*-------------------------------------------------------------------------*/
+int socket_gethostbyaddr(const char *addr, socklen_t len, struct hostent **hp) {
+ *hp = gethostbyaddr(addr, len, AF_INET);
+ if (*hp) return IO_DONE;
+ else return WSAGetLastError();
+}
+
+int socket_gethostbyname(const char *addr, struct hostent **hp) {
+ *hp = gethostbyname(addr);
+ if (*hp) return IO_DONE;
+ else return WSAGetLastError();
+}
+
+/*-------------------------------------------------------------------------*\
+* Error translation functions
+\*-------------------------------------------------------------------------*/
+const char *socket_hoststrerror(int err) {
+ if (err <= 0) return io_strerror(err);
+ switch (err) {
+ case WSAHOST_NOT_FOUND: return "host not found";
+ default: return wstrerror(err);
+ }
+}
+
+const char *socket_strerror(int err) {
+ if (err <= 0) return io_strerror(err);
+ switch (err) {
+ case WSAEADDRINUSE: return "address already in use";
+ case WSAECONNREFUSED: return "connection refused";
+ case WSAEISCONN: return "already connected";
+ case WSAEACCES: return "permission denied";
+ case WSAECONNABORTED: return "closed";
+ case WSAECONNRESET: return "closed";
+ case WSAETIMEDOUT: return "timeout";
+ default: return wstrerror(err);
+ }
+}
+
+const char *socket_ioerror(p_socket ps, int err) {
+ (void) ps;
+ return socket_strerror(err);
+}
+
+static const char *wstrerror(int err) {
+ switch (err) {
+ case WSAEINTR: return "Interrupted function call";
+ case WSAEACCES: return "Permission denied";
+ case WSAEFAULT: return "Bad address";
+ case WSAEINVAL: return "Invalid argument";
+ case WSAEMFILE: return "Too many open files";
+ case WSAEWOULDBLOCK: return "Resource temporarily unavailable";
+ case WSAEINPROGRESS: return "Operation now in progress";
+ case WSAEALREADY: return "Operation already in progress";
+ case WSAENOTSOCK: return "Socket operation on nonsocket";
+ case WSAEDESTADDRREQ: return "Destination address required";
+ case WSAEMSGSIZE: return "Message too long";
+ case WSAEPROTOTYPE: return "Protocol wrong type for socket";
+ case WSAENOPROTOOPT: return "Bad protocol option";
+ case WSAEPROTONOSUPPORT: return "Protocol not supported";
+ case WSAESOCKTNOSUPPORT: return "Socket type not supported";
+ case WSAEOPNOTSUPP: return "Operation not supported";
+ case WSAEPFNOSUPPORT: return "Protocol family not supported";
+ case WSAEAFNOSUPPORT:
+ return "Address family not supported by protocol family";
+ case WSAEADDRINUSE: return "Address already in use";
+ case WSAEADDRNOTAVAIL: return "Cannot assign requested address";
+ case WSAENETDOWN: return "Network is down";
+ case WSAENETUNREACH: return "Network is unreachable";
+ case WSAENETRESET: return "Network dropped connection on reset";
+ case WSAECONNABORTED: return "Software caused connection abort";
+ case WSAECONNRESET: return "Connection reset by peer";
+ case WSAENOBUFS: return "No buffer space available";
+ case WSAEISCONN: return "Socket is already connected";
+ case WSAENOTCONN: return "Socket is not connected";
+ case WSAESHUTDOWN: return "Cannot send after socket shutdown";
+ case WSAETIMEDOUT: return "Connection timed out";
+ case WSAECONNREFUSED: return "Connection refused";
+ case WSAEHOSTDOWN: return "Host is down";
+ case WSAEHOSTUNREACH: return "No route to host";
+ case WSAEPROCLIM: return "Too many processes";
+ case WSASYSNOTREADY: return "Network subsystem is unavailable";
+ case WSAVERNOTSUPPORTED: return "Winsock.dll version out of range";
+ case WSANOTINITIALISED:
+ return "Successful WSAStartup not yet performed";
+ case WSAEDISCON: return "Graceful shutdown in progress";
+ case WSAHOST_NOT_FOUND: return "Host not found";
+ case WSATRY_AGAIN: return "Nonauthoritative host not found";
+ case WSANO_RECOVERY: return "Nonrecoverable name lookup error";
+ case WSANO_DATA: return "Valid name, no data record of requested type";
+ default: return "Unknown error";
+ }
+}
+
+const char *socket_gaistrerror(int err) {
+ if (err == 0) return NULL;
+ switch (err) {
+ case EAI_AGAIN: return "temporary failure in name resolution";
+ case EAI_BADFLAGS: return "invalid value for ai_flags";
+#ifdef EAI_BADHINTS
+ case EAI_BADHINTS: return "invalid value for hints";
+#endif
+ case EAI_FAIL: return "non-recoverable failure in name resolution";
+ case EAI_FAMILY: return "ai_family not supported";
+ case EAI_MEMORY: return "memory allocation failure";
+ case EAI_NONAME:
+ return "host or service not provided, or not known";
+#ifdef EAI_OVERFLOW
+ case EAI_OVERFLOW: return "argument buffer overflow";
+#endif
+#ifdef EAI_PROTOCOL
+ case EAI_PROTOCOL: return "resolved protocol is unknown";
+#endif
+ case EAI_SERVICE: return "service not supported for socket type";
+ case EAI_SOCKTYPE: return "ai_socktype not supported";
+#ifdef EAI_SYSTEM
+ case EAI_SYSTEM: return strerror(errno);
+#endif
+ default: return gai_strerror(err);
+ }
+}
+
diff --git a/src/wsocket.h b/src/wsocket.h
new file mode 100644
index 0000000..3986640
--- /dev/null
+++ b/src/wsocket.h
@@ -0,0 +1,33 @@
+#ifndef WSOCKET_H
+#define WSOCKET_H
+/*=========================================================================*\
+* Socket compatibilization module for Win32
+* LuaSocket toolkit
+\*=========================================================================*/
+
+/*=========================================================================*\
+* WinSock include files
+\*=========================================================================*/
+#include
+#include
+
+typedef int socklen_t;
+typedef SOCKADDR_STORAGE t_sockaddr_storage;
+typedef SOCKET t_socket;
+typedef t_socket *p_socket;
+
+#ifndef IPV6_V6ONLY
+#define IPV6_V6ONLY 27
+#endif
+
+#define SOCKET_INVALID (INVALID_SOCKET)
+
+#ifndef SO_REUSEPORT
+#define SO_REUSEPORT SO_REUSEADDR
+#endif
+
+#ifndef AI_NUMERICSERV
+#define AI_NUMERICSERV (0)
+#endif
+
+#endif /* WSOCKET_H */
diff --git a/test/README b/test/README
new file mode 100644
index 0000000..27837e0
--- /dev/null
+++ b/test/README
@@ -0,0 +1,14 @@
+This provides the automated test scripts used to make sure the library
+is working properly.
+
+The files provided are:
+
+ testsrvr.lua -- test server
+ testclnt.lua -- test client
+
+To run these tests, just run lua on the server and then on the client.
+
+ hello.lua -- run to verify if installation worked
+
+Good luck,
+Diego.
diff --git a/test/auth/.htpasswd b/test/auth/.htpasswd
new file mode 100644
index 0000000..fd9002b
--- /dev/null
+++ b/test/auth/.htpasswd
@@ -0,0 +1 @@
+luasocket:l8n2npozPB.sQ
diff --git a/test/auth/index.html b/test/auth/index.html
new file mode 100644
index 0000000..786694e
--- /dev/null
+++ b/test/auth/index.html
@@ -0,0 +1,3002 @@
+
+
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+
+
diff --git a/test/cgi/cat b/test/cgi/cat
new file mode 100755
index 0000000..8d41255
--- /dev/null
+++ b/test/cgi/cat
@@ -0,0 +1,6 @@
+#!/bin/sh
+echo Content-type: text/plain
+echo
+
+cat > /tmp/luasocket.cat.tmp
+cat /tmp/luasocket.cat.tmp
diff --git a/test/cgi/cat-index-html b/test/cgi/cat-index-html
new file mode 100755
index 0000000..7595043
--- /dev/null
+++ b/test/cgi/cat-index-html
@@ -0,0 +1,5 @@
+#!/bin/sh
+echo Content-type: text/plain
+echo
+
+cat ../index.html
diff --git a/test/cgi/env b/test/cgi/env
new file mode 100755
index 0000000..412a716
--- /dev/null
+++ b/test/cgi/env
@@ -0,0 +1,5 @@
+#!/bin/sh
+echo Content-type: text/plain
+echo
+
+env
diff --git a/test/cgi/query-string b/test/cgi/query-string
new file mode 100755
index 0000000..2342af5
--- /dev/null
+++ b/test/cgi/query-string
@@ -0,0 +1,4 @@
+#!/bin/sh
+echo Content-type: text/plain
+echo
+echo $QUERY_STRING
diff --git a/test/cgi/redirect-loop b/test/cgi/redirect-loop
new file mode 100755
index 0000000..bd32f20
--- /dev/null
+++ b/test/cgi/redirect-loop
@@ -0,0 +1,3 @@
+#!/bin/sh
+echo Location: http://$HTTP_HOST$REQUEST_URI
+echo
diff --git a/test/cgi/request-uri b/test/cgi/request-uri
new file mode 100755
index 0000000..20ebe9f
--- /dev/null
+++ b/test/cgi/request-uri
@@ -0,0 +1,4 @@
+#!/bin/sh
+echo Content-type: text/plain
+echo
+echo $REQUEST_URI
diff --git a/test/dicttest.lua b/test/dicttest.lua
new file mode 100644
index 0000000..a0da2e1
--- /dev/null
+++ b/test/dicttest.lua
@@ -0,0 +1,5 @@
+local dict = require"socket.dict"
+
+print(dict.get("dict://localhost/d:teste"))
+
+for i,v in pairs(dict.get("dict://localhost/d:teste")) do print(v) end
diff --git a/test/excepttest.lua b/test/excepttest.lua
new file mode 100644
index 0000000..ce9f197
--- /dev/null
+++ b/test/excepttest.lua
@@ -0,0 +1,6 @@
+local socket = require("socket")
+try = socket.newtry(function()
+ print("finalized!!!")
+end)
+try = socket.protect(try)
+print(try(nil, "it works"))
diff --git a/test/find-connect-limit b/test/find-connect-limit
new file mode 100755
index 0000000..ad0c3f5
--- /dev/null
+++ b/test/find-connect-limit
@@ -0,0 +1,32 @@
+#!/usr/bin/env lua
+--[[
+Find out how many TCP connections we can make.
+
+Use ulimit to increase the max number of descriptors:
+
+ulimit -n 10000
+ulimit -n
+
+You'll probably need to be root to do this.
+]]
+
+require "socket"
+
+host = arg[1] or "google.com"
+port = arg[2] or 80
+
+connections = {}
+
+repeat
+ c = assert(socket.connect(hostip or host, 80))
+ table.insert(connections, c)
+
+ if not hostip then
+ hostip = c:getpeername()
+ print("resolved", host, "to", hostip)
+ end
+
+ print("connection #", #connections, c, "fd", c:getfd())
+
+until false
+
diff --git a/test/ftptest.lua b/test/ftptest.lua
new file mode 100644
index 0000000..fb13326
--- /dev/null
+++ b/test/ftptest.lua
@@ -0,0 +1,110 @@
+local socket = require("socket")
+local ftp = require("socket.ftp")
+local url = require("socket.url")
+local ltn12 = require("ltn12")
+
+-- override protection to make sure we see all errors
+--socket.protect = function(s) return s end
+
+dofile("testsupport.lua")
+
+local host, port, index_file, index, back, err, ret
+
+local t = socket.gettime()
+
+host = host or "localhost"
+index_file = "index.html"
+
+
+-- a function that returns a directory listing
+local function nlst(u)
+ local t = {}
+ local p = url.parse(u)
+ p.command = "nlst"
+ p.sink = ltn12.sink.table(t)
+ local r, e = ftp.get(p)
+ return r and table.concat(t), e
+end
+
+-- function that removes a remote file
+local function dele(u)
+ local p = url.parse(u)
+ p.command = "dele"
+ p.argument = string.gsub(p.path, "^/", "")
+ if p.argumet == "" then p.argument = nil end
+ p.check = 250
+ return ftp.command(p)
+end
+
+-- read index with CRLF convention
+index = readfile(index_file)
+
+io.write("testing wrong scheme: ")
+back, err = ftp.get("wrong://banana.com/lixo")
+assert(not back and err == "wrong scheme 'wrong'", err)
+print("ok")
+
+io.write("testing invalid url: ")
+back, err = ftp.get("localhost/dir1/index.html;type=i")
+assert(not back and err)
+print("ok")
+
+io.write("testing anonymous file download: ")
+back, err = socket.ftp.get("ftp://" .. host .. "/pub/index.html;type=i")
+assert(not err and back == index, err)
+print("ok")
+
+io.write("erasing before upload: ")
+ret, err = dele("ftp://luasocket:pedrovian@" .. host .. "/index.up.html")
+if not ret then print(err)
+else print("ok") end
+
+io.write("testing upload: ")
+ret, err = ftp.put("ftp://luasocket:pedrovian@" .. host .. "/index.up.html;type=i", index)
+assert(ret and not err, err)
+print("ok")
+
+io.write("downloading uploaded file: ")
+back, err = ftp.get("ftp://luasocket:pedrovian@" .. host .. "/index.up.html;type=i")
+assert(ret and not err and index == back, err)
+print("ok")
+
+io.write("erasing after upload/download: ")
+ret, err = dele("ftp://luasocket:pedrovian@" .. host .. "/index.up.html")
+assert(ret and not err, err)
+print("ok")
+
+io.write("testing weird-character translation: ")
+back, err = ftp.get("ftp://luasocket:pedrovian@" .. host .. "/%23%3f;type=i")
+assert(not err and back == index, err)
+print("ok")
+
+io.write("testing parameter overriding: ")
+local back = {}
+ret, err = ftp.get{
+ url = "//stupid:mistake@" .. host .. "/index.html",
+ user = "luasocket",
+ password = "pedrovian",
+ type = "i",
+ sink = ltn12.sink.table(back)
+}
+assert(ret and not err and table.concat(back) == index, err)
+print("ok")
+
+io.write("testing upload denial: ")
+ret, err = ftp.put("ftp://" .. host .. "/index.up.html;type=a", index)
+assert(not ret and err, "should have failed")
+print(err)
+
+io.write("testing authentication failure: ")
+ret, err = ftp.get("ftp://luasocket:wrong@".. host .. "/index.html;type=a")
+assert(not ret and err, "should have failed")
+print(err)
+
+io.write("testing wrong file: ")
+back, err = ftp.get("ftp://".. host .. "/index.wrong.html;type=a")
+assert(not back and err, "should have failed")
+print(err)
+
+print("passed all tests")
+print(string.format("done in %.2fs", socket.gettime() - t))
diff --git a/test/hello.lua b/test/hello.lua
new file mode 100644
index 0000000..3f385dc
--- /dev/null
+++ b/test/hello.lua
@@ -0,0 +1,3 @@
+local socket = require"socket"
+local mime = require"mime"
+print("Hello from " .. socket._VERSION .. " and " .. mime._VERSION .. "!")
diff --git a/test/httptest.lua b/test/httptest.lua
new file mode 100644
index 0000000..d5fbb37
--- /dev/null
+++ b/test/httptest.lua
@@ -0,0 +1,441 @@
+-- needs Alias from /home/c/diego/tec/luasocket/test to
+-- "/luasocket-test" and "/luasocket-test/"
+-- needs ScriptAlias from /home/c/diego/tec/luasocket/test/cgi
+-- to "/luasocket-test-cgi" and "/luasocket-test-cgi/"
+-- needs "AllowOverride AuthConfig" on /home/c/diego/tec/luasocket/test/auth
+local socket = require("socket")
+local http = require("socket.http")
+local url = require("socket.url")
+
+local mime = require("mime")
+local ltn12 = require("ltn12")
+
+-- override protection to make sure we see all errors
+-- socket.protect = function(s) return s end
+
+dofile("testsupport.lua")
+
+local host, proxy, request, response, index_file
+local ignore, expect, index, prefix, cgiprefix, index_crlf
+
+http.TIMEOUT = 10
+
+local t = socket.gettime()
+
+--host = host or "diego.student.princeton.edu"
+--host = host or "diego.student.princeton.edu"
+host = host or "localhost"
+proxy = proxy or "http://localhost:3128"
+prefix = prefix or "/luasocket-test"
+cgiprefix = cgiprefix or "/luasocket-test-cgi"
+index_file = "index.html"
+
+-- read index with CRLF convention
+index = readfile(index_file)
+
+local check_result = function(response, expect, ignore)
+ for i,v in pairs(response) do
+ if not ignore[i] then
+ if v ~= expect[i] then
+ local f = io.open("err", "w")
+ f:write(tostring(v), "\n\n versus\n\n", tostring(expect[i]))
+ f:close()
+ fail(i .. " differs!")
+ end
+ end
+ end
+ for i,v in pairs(expect) do
+ if not ignore[i] then
+ if v ~= response[i] then
+ local f = io.open("err", "w")
+ f:write(tostring(response[i]), "\n\n versus\n\n", tostring(v))
+ v = string.sub(type(v) == "string" and v or "", 1, 70)
+ f:close()
+ fail(i .. " differs!")
+ end
+ end
+ end
+ print("ok")
+end
+
+local check_request = function(request, expect, ignore)
+ local t
+ if not request.sink then request.sink, t = ltn12.sink.table() end
+ request.source = request.source or
+ (request.body and ltn12.source.string(request.body))
+ local response = {}
+ response.code, response.headers, response.status =
+ socket.skip(1, http.request(request))
+ if t and #t > 0 then response.body = table.concat(t) end
+ check_result(response, expect, ignore)
+end
+
+------------------------------------------------------------------------
+io.write("testing request uri correctness: ")
+local forth = cgiprefix .. "/request-uri?" .. "this+is+the+query+string"
+local back, c, h = http.request("http://" .. host .. forth)
+if not back then fail(c) end
+back = url.parse(back)
+if similar(back.query, "this+is+the+query+string") then print("ok")
+else fail(back.query) end
+
+------------------------------------------------------------------------
+io.write("testing query string correctness: ")
+forth = "this+is+the+query+string"
+back = http.request("http://" .. host .. cgiprefix ..
+ "/query-string?" .. forth)
+if similar(back, forth) then print("ok")
+else fail("failed!") end
+
+------------------------------------------------------------------------
+io.write("testing document retrieval: ")
+request = {
+ url = "http://" .. host .. prefix .. "/index.html"
+}
+expect = {
+ body = index,
+ code = 200
+}
+ignore = {
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+
+------------------------------------------------------------------------
+io.write("testing redirect loop: ")
+request = {
+ url = "http://" .. host .. cgiprefix .. "/redirect-loop"
+}
+expect = {
+ code = 302
+}
+ignore = {
+ status = 1,
+ headers = 1,
+ body = 1
+}
+check_request(request, expect, ignore)
+
+------------------------------------------------------------------------
+io.write("testing invalid url: ")
+local r, e = http.request{url = host .. prefix}
+assert(r == nil and e == "invalid host ''")
+r, re = http.request(host .. prefix)
+assert(r == nil and e == re, tostring(r) ..", " .. tostring(re) ..
+ " vs " .. tostring(e))
+print("ok")
+
+io.write("testing invalid empty port: ")
+request = {
+ url = "http://" .. host .. ":" .. prefix .. "/index.html"
+}
+expect = {
+ body = index,
+ code = 200
+}
+ignore = {
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+
+------------------------------------------------------------------------
+io.write("testing post method: ")
+-- wanted to test chunked post, but apache doesn't support it...
+request = {
+ url = "http://" .. host .. cgiprefix .. "/cat",
+ method = "POST",
+ body = index,
+ -- remove content-length header to send chunked body
+ headers = { ["content-length"] = string.len(index) }
+}
+expect = {
+ body = index,
+ code = 200
+}
+ignore = {
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+
+------------------------------------------------------------------------
+--[[
+io.write("testing proxy with post method: ")
+request = {
+ url = "http://" .. host .. cgiprefix .. "/cat",
+ method = "POST",
+ body = index,
+ headers = { ["content-length"] = string.len(index) },
+ proxy= proxy
+}
+expect = {
+ body = index,
+ code = 200
+}
+ignore = {
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+]]
+
+------------------------------------------------------------------------
+io.write("testing simple post function: ")
+back = http.request("http://" .. host .. cgiprefix .. "/cat", index)
+assert(back == index)
+print("ok")
+
+------------------------------------------------------------------------
+io.write("testing ltn12.(sink|source).file: ")
+request = {
+ url = "http://" .. host .. cgiprefix .. "/cat",
+ method = "POST",
+ source = ltn12.source.file(io.open(index_file, "rb")),
+ sink = ltn12.sink.file(io.open(index_file .. "-back", "wb")),
+ headers = { ["content-length"] = string.len(index) }
+}
+expect = {
+ code = 200
+}
+ignore = {
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+back = readfile(index_file .. "-back")
+assert(back == index)
+os.remove(index_file .. "-back")
+
+------------------------------------------------------------------------
+io.write("testing ltn12.(sink|source).chain and mime.(encode|decode): ")
+
+local function b64length(len)
+ local a = math.ceil(len/3)*4
+ local l = math.ceil(a/76)
+ return a + l*2
+end
+
+local source = ltn12.source.chain(
+ ltn12.source.file(io.open(index_file, "rb")),
+ ltn12.filter.chain(
+ mime.encode("base64"),
+ mime.wrap("base64")
+ )
+)
+
+local sink = ltn12.sink.chain(
+ mime.decode("base64"),
+ ltn12.sink.file(io.open(index_file .. "-back", "wb"))
+)
+
+request = {
+ url = "http://" .. host .. cgiprefix .. "/cat",
+ method = "POST",
+ source = source,
+ sink = sink,
+ headers = { ["content-length"] = b64length(string.len(index)) }
+}
+expect = {
+ code = 200
+}
+ignore = {
+ body_cb = 1,
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+back = readfile(index_file .. "-back")
+assert(back == index)
+os.remove(index_file .. "-back")
+
+------------------------------------------------------------------------
+io.write("testing http redirection: ")
+request = {
+ url = "http://" .. host .. prefix
+}
+expect = {
+ body = index,
+ code = 200
+}
+ignore = {
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+
+------------------------------------------------------------------------
+--[[
+io.write("testing proxy with redirection: ")
+request = {
+ url = "http://" .. host .. prefix,
+ proxy = proxy
+}
+expect = {
+ body = index,
+ code = 200
+}
+ignore = {
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+]]
+
+------------------------------------------------------------------------
+io.write("testing automatic auth failure: ")
+request = {
+ url = "http://really:wrong@" .. host .. prefix .. "/auth/index.html"
+}
+expect = {
+ code = 401
+}
+ignore = {
+ body = 1,
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+
+------------------------------------------------------------------------
+io.write("testing http redirection failure: ")
+request = {
+ url = "http://" .. host .. prefix,
+ redirect = false
+}
+expect = {
+ code = 301
+}
+ignore = {
+ body = 1,
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+
+------------------------------------------------------------------------
+io.write("testing document not found: ")
+request = {
+ url = "http://" .. host .. "/wrongdocument.html"
+}
+expect = {
+ code = 404
+}
+ignore = {
+ body = 1,
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+
+------------------------------------------------------------------------
+io.write("testing auth failure: ")
+request = {
+ url = "http://" .. host .. prefix .. "/auth/index.html"
+}
+expect = {
+ code = 401
+}
+ignore = {
+ body = 1,
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+
+------------------------------------------------------------------------
+io.write("testing manual basic auth: ")
+request = {
+ url = "http://" .. host .. prefix .. "/auth/index.html",
+ headers = {
+ authorization = "Basic " .. (mime.b64("luasocket:password"))
+ }
+}
+expect = {
+ code = 200,
+ body = index
+}
+ignore = {
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+
+------------------------------------------------------------------------
+io.write("testing automatic basic auth: ")
+request = {
+ url = "http://luasocket:password@" .. host .. prefix .. "/auth/index.html"
+}
+expect = {
+ code = 200,
+ body = index
+}
+ignore = {
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+
+------------------------------------------------------------------------
+io.write("testing auth info overriding: ")
+request = {
+ url = "http://really:wrong@" .. host .. prefix .. "/auth/index.html",
+ user = "luasocket",
+ password = "password"
+}
+expect = {
+ code = 200,
+ body = index
+}
+ignore = {
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+
+------------------------------------------------------------------------
+io.write("testing cgi output retrieval (probably chunked...): ")
+request = {
+ url = "http://" .. host .. cgiprefix .. "/cat-index-html"
+}
+expect = {
+ body = index,
+ code = 200
+}
+ignore = {
+ status = 1,
+ headers = 1
+}
+check_request(request, expect, ignore)
+
+------------------------------------------------------------------------
+local body
+io.write("testing simple request function: ")
+body = http.request("http://" .. host .. prefix .. "/index.html")
+assert(body == index)
+print("ok")
+
+------------------------------------------------------------------------
+io.write("testing HEAD method: ")
+local r, c, h = http.request {
+ method = "HEAD",
+ url = "http://www.tecgraf.puc-rio.br/~diego/"
+}
+assert(r and h and (c == 200), c)
+print("ok")
+
+------------------------------------------------------------------------
+io.write("testing host not found: ")
+local c, e = socket.connect("example.invalid", 80)
+local r, re = http.request{url = "http://example.invalid/does/not/exist"}
+assert(r == nil and e == re, tostring(r) .. " " .. tostring(re))
+r, re = http.request("http://example.invalid/does/not/exist")
+assert(r == nil and e == re)
+print("ok")
+
+------------------------------------------------------------------------
+print("passed all tests")
+os.remove("err")
+
+print(string.format("done in %.2fs", socket.gettime() - t))
diff --git a/test/index.html b/test/index.html
new file mode 100644
index 0000000..786694e
--- /dev/null
+++ b/test/index.html
@@ -0,0 +1,3002 @@
+
+
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+This document can contain anything, as long as it is long enough!
+
+
diff --git a/test/ltn12test.lua b/test/ltn12test.lua
new file mode 100644
index 0000000..74a45e8
--- /dev/null
+++ b/test/ltn12test.lua
@@ -0,0 +1,274 @@
+local ltn12 = require("ltn12")
+
+dofile("testsupport.lua")
+
+local function format(chunk)
+ if chunk then
+ if chunk == "" then return "''"
+ else return string.len(chunk) end
+ else return "nil" end
+end
+
+local function show(name, input, output)
+ local sin = format(input)
+ local sout = format(output)
+ io.write(name, ": ", sin, " -> ", sout, "\n")
+end
+
+local function chunked(length)
+ local tmp
+ return function(chunk)
+ local ret
+ if chunk and chunk ~= "" then
+ tmp = chunk
+ end
+ ret = string.sub(tmp, 1, length)
+ tmp = string.sub(tmp, length+1)
+ if not chunk and ret == "" then ret = nil end
+ return ret
+ end
+end
+
+local function named(f, name)
+ return function(chunk)
+ local ret = f(chunk)
+ show(name, chunk, ret)
+ return ret
+ end
+end
+
+--------------------------------
+local function split(size)
+ local buffer = ""
+ local last_out = ""
+ local last_in = ""
+ local function output(chunk)
+ local part = string.sub(buffer, 1, size)
+ buffer = string.sub(buffer, size+1)
+ last_out = (part ~= "" or chunk) and part
+ last_in = chunk
+ return last_out
+ end
+ return function(chunk, done)
+ if done then
+ return not last_in and not last_out
+ end
+ -- check if argument is consistent with state
+ if not chunk then
+ if last_in and last_in ~= "" and last_out ~= "" then
+ error("nil chunk following data chunk", 2)
+ end
+ if not last_out then error("extra nil chunk", 2) end
+ return output(chunk)
+ elseif chunk == "" then
+ if last_out == "" then error('extra "" chunk', 2) end
+ if not last_out then error('"" chunk following nil return', 2) end
+ if not last_in then error('"" chunk following nil chunk', 2) end
+ return output(chunk)
+ else
+ if not last_in then error("data chunk following nil chunk", 2) end
+ if last_in ~= "" and last_out ~= "" then
+ error("data chunk following data chunk", 2)
+ end
+ buffer = chunk
+ return output(chunk)
+ end
+ end
+end
+
+--------------------------------
+local function format(chunk)
+ if chunk then
+ if chunk == "" then return "''"
+ else return string.len(chunk) end
+ else return "nil" end
+end
+
+--------------------------------
+local function merge(size)
+ local buffer = ""
+ local last_out = ""
+ local last_in = ""
+ local function output(chunk)
+ local part
+ if string.len(buffer) >= size or not chunk then
+ part = buffer
+ buffer = ""
+ else
+ part = ""
+ end
+ last_out = (part ~= "" or chunk) and part
+ last_in = chunk
+ return last_out
+ end
+ return function(chunk, done)
+ if done then
+ return not last_in and not last_out
+ end
+ -- check if argument is consistent with state
+ if not chunk then
+ if last_in and last_in ~= "" and last_out ~= "" then
+ error("nil chunk following data chunk", 2)
+ end
+ if not last_out then error("extra nil chunk", 2) end
+ return output(chunk)
+ elseif chunk == "" then
+ if last_out == "" then error('extra "" chunk', 2) end
+ if not last_out then error('"" chunk following nil return', 2) end
+ if not last_in then error('"" chunk following nil chunk', 2) end
+ return output(chunk)
+ else
+ if not last_in then error("data chunk following nil chunk", 2) end
+ if last_in ~= "" and last_out ~= "" then
+ error("data chunk following data chunk", 2)
+ end
+ buffer = buffer .. chunk
+ return output(chunk)
+ end
+ end
+end
+
+--------------------------------
+io.write("testing sink.table: ")
+local sink, t = ltn12.sink.table()
+local s, c = "", ""
+for i = 0, 10 do
+ c = string.rep(string.char(i), i)
+ s = s .. c
+ assert(sink(c), "returned error")
+end
+assert(sink(nil), "returned error")
+assert(table.concat(t) == s, "mismatch")
+print("ok")
+
+--------------------------------
+io.write("testing sink.chain (with split): ")
+sink, t = ltn12.sink.table()
+local filter = split(3)
+sink = ltn12.sink.chain(filter, sink)
+s = "123456789012345678901234567890"
+assert(sink(s), "returned error")
+assert(sink(s), "returned error")
+assert(sink(nil), "returned error")
+assert(table.concat(t) == s .. s, "mismatch")
+assert(filter(nil, 1), "filter not empty")
+print("ok")
+
+--------------------------------
+io.write("testing sink.chain (with merge): ")
+sink, t = ltn12.sink.table()
+filter = merge(10)
+sink = ltn12.sink.chain(filter, sink)
+s = string.rep("123", 30)
+s = s .. string.rep("4321", 30)
+for i = 1, 30 do
+ assert(sink("123"), "returned error")
+end
+for i = 1, 30 do
+ assert(sink("4321"), "returned error")
+end
+assert(sink(nil), "returned error")
+assert(filter(nil, 1), "filter not empty")
+assert(table.concat(t) == s, "mismatch")
+print("ok")
+
+--------------------------------
+io.write("testing source.string and pump.all: ")
+local source = ltn12.source.string(s)
+sink, t = ltn12.sink.table()
+assert(ltn12.pump.all(source, sink), "returned error")
+assert(table.concat(t) == s, "mismatch")
+print("ok")
+
+--------------------------------
+io.write("testing source.chain (with split): ")
+source = ltn12.source.string(s)
+filter = split(5)
+source = ltn12.source.chain(source, filter)
+sink, t = ltn12.sink.table()
+assert(ltn12.pump.all(source, sink), "returned error")
+assert(table.concat(t) == s, "mismatch")
+assert(filter(nil, 1), "filter not empty")
+print("ok")
+
+--------------------------------
+io.write("testing source.chain (with split) and sink.chain (with merge): ")
+source = ltn12.source.string(s)
+filter = split(5)
+source = ltn12.source.chain(source, filter)
+local filter2 = merge(13)
+sink, t = ltn12.sink.table()
+sink = ltn12.sink.chain(filter2, sink)
+assert(ltn12.pump.all(source, sink), "returned error")
+assert(table.concat(t) == s, "mismatch")
+assert(filter(nil, 1), "filter not empty")
+assert(filter2(nil, 1), "filter2 not empty")
+print("ok")
+
+--------------------------------
+io.write("testing filter.chain (and sink.chain, with split, merge): ")
+source = ltn12.source.string(s)
+filter = split(5)
+filter2 = merge(13)
+local chain = ltn12.filter.chain(filter, filter2)
+sink, t = ltn12.sink.table()
+sink = ltn12.sink.chain(chain, sink)
+assert(ltn12.pump.all(source, sink), "returned error")
+assert(table.concat(t) == s, "mismatch")
+assert(filter(nil, 1), "filter not empty")
+assert(filter2(nil, 1), "filter2 not empty")
+print("ok")
+
+--------------------------------
+io.write("testing filter.chain (and sink.chain, a bunch): ")
+source = ltn12.source.string(s)
+filter = split(5)
+filter2 = merge(13)
+local filter3 = split(7)
+local filter4 = merge(11)
+local filter5 = split(10)
+chain = ltn12.filter.chain(filter, filter2, filter3, filter4, filter5)
+sink, t = ltn12.sink.table()
+sink = ltn12.sink.chain(chain, sink)
+assert(ltn12.pump.all(source, sink))
+assert(table.concat(t) == s, "mismatch")
+assert(filter(nil, 1), "filter not empty")
+assert(filter2(nil, 1), "filter2 not empty")
+assert(filter3(nil, 1), "filter3 not empty")
+assert(filter4(nil, 1), "filter4 not empty")
+assert(filter5(nil, 1), "filter5 not empty")
+print("ok")
+
+--------------------------------
+io.write("testing filter.chain (and source.chain, with split, merge): ")
+source = ltn12.source.string(s)
+filter = split(5)
+filter2 = merge(13)
+local chain = ltn12.filter.chain(filter, filter2)
+sink, t = ltn12.sink.table()
+source = ltn12.source.chain(source, chain)
+assert(ltn12.pump.all(source, sink), "returned error")
+assert(table.concat(t) == s, "mismatch")
+assert(filter(nil, 1), "filter not empty")
+assert(filter2(nil, 1), "filter2 not empty")
+print("ok")
+
+--------------------------------
+io.write("testing filter.chain (and source.chain, a bunch): ")
+source = ltn12.source.string(s)
+filter = split(5)
+filter2 = merge(13)
+local filter3 = split(7)
+local filter4 = merge(11)
+local filter5 = split(10)
+chain = ltn12.filter.chain(filter, filter2, filter3, filter4, filter5)
+sink, t = ltn12.sink.table()
+source = ltn12.source.chain(source, chain)
+assert(ltn12.pump.all(source, sink))
+assert(table.concat(t) == s, "mismatch")
+assert(filter(nil, 1), "filter not empty")
+assert(filter2(nil, 1), "filter2 not empty")
+assert(filter3(nil, 1), "filter3 not empty")
+assert(filter4(nil, 1), "filter4 not empty")
+assert(filter5(nil, 1), "filter5 not empty")
+print("ok")
diff --git a/test/luasocket.png b/test/luasocket.png
new file mode 100644
index 0000000..d24a954
Binary files /dev/null and b/test/luasocket.png differ
diff --git a/test/mimetest.lua b/test/mimetest.lua
new file mode 100644
index 0000000..f5b3747
--- /dev/null
+++ b/test/mimetest.lua
@@ -0,0 +1,299 @@
+local socket = require("socket")
+local ltn12 = require("ltn12")
+local mime = require("mime")
+
+local unpack = unpack or table.unpack
+
+dofile("testsupport.lua")
+
+local qptest = "qptest.bin"
+local eqptest = "qptest.bin2"
+local dqptest = "qptest.bin3"
+
+local b64test = "b64test.bin"
+local eb64test = "b64test.bin2"
+local db64test = "b64test.bin3"
+
+
+-- from Machado de Assis, "A Mão e a Rosa"
+local mao = [[
+ Cursavam estes dois moços a academia de S. Paulo, estando
+ Luís Alves no quarto ano e Estêvão no terceiro.
+ Conheceram-se na academia, e ficaram amigos íntimos, tanto
+ quanto podiam sê-lo dois espíritos diferentes, ou talvez por
+ isso mesmo que o eram. Estêvão, dotado de extrema
+ sensibilidade, e não menor fraqueza de ânimo, afetuoso e
+ bom, não daquela bondade varonil, que é apanágio de uma alma
+ forte, mas dessa outra bondade mole e de cera, que vai à
+ mercê de todas as circunstâncias, tinha, além de tudo isso,
+ o infortúnio de trazer ainda sobre o nariz os óculos
+ cor-de-rosa de suas virginais ilusões. Luís Alves via bem
+ com os olhos da cara. Não era mau rapaz, mas tinha o seu
+ grão de egoísmo, e se não era incapaz de afeições, sabia
+ regê-las, moderá-las, e sobretudo guiá-las ao seu próprio
+ interesse. Entre estes dois homens travara-se amizade
+ íntima, nascida para um na simpatia, para outro no costume.
+ Eram eles os naturais confidentes um do outro, com a
+ diferença que Luís Alves dava menos do que recebia, e, ainda
+ assim, nem tudo o que dava exprimia grande confiança.
+]]
+
+local function random(handle, io_err)
+ if handle then
+ return function()
+ if not handle then error("source is empty!", 2) end
+ local len = math.random(0, 1024)
+ local chunk = handle:read(len)
+ if not chunk then
+ handle:close()
+ handle = nil
+ end
+ return chunk
+ end
+ else return ltn12.source.empty(io_err or "unable to open file") end
+end
+
+
+local function named(f)
+ return f
+end
+
+local what = nil
+local function transform(input, output, filter)
+ local source = random(io.open(input, "rb"))
+ local sink = ltn12.sink.file(io.open(output, "wb"))
+ if what then
+ sink = ltn12.sink.chain(filter, sink)
+ else
+ source = ltn12.source.chain(source, filter)
+ end
+ --what = not what
+ ltn12.pump.all(source, sink)
+end
+
+local function encode_qptest(mode)
+ local encode = mime.encode("quoted-printable", mode)
+ local split = mime.wrap("quoted-printable")
+ local chain = ltn12.filter.chain(encode, split)
+ transform(qptest, eqptest, chain)
+end
+
+local function compare_qptest()
+io.write("testing qp encoding and wrap: ")
+ compare(qptest, dqptest)
+end
+
+local function decode_qptest()
+ local decode = mime.decode("quoted-printable")
+ transform(eqptest, dqptest, decode)
+end
+
+local function create_qptest()
+ local f, err = io.open(qptest, "wb")
+ if not f then fail(err) end
+ -- try all characters
+ for i = 0, 255 do
+ f:write(string.char(i))
+ end
+ -- try all characters and different line sizes
+ for i = 0, 255 do
+ for j = 0, i do
+ f:write(string.char(i))
+ end
+ f:write("\r\n")
+ end
+ -- test latin text
+ f:write(mao)
+ -- force soft line breaks and treatment of space/tab in end of line
+ local tab
+ f:write(string.gsub(mao, "(%s)", function(c)
+ if tab then
+ tab = nil
+ return "\t"
+ else
+ tab = 1
+ return " "
+ end
+ end))
+ -- test crazy end of line conventions
+ local eol = { "\r\n", "\r", "\n", "\n\r" }
+ local which = 0
+ f:write(string.gsub(mao, "(\n)", function(c)
+ which = which + 1
+ if which > 4 then which = 1 end
+ return eol[which]
+ end))
+ for i = 1, 4 do
+ for j = 1, 4 do
+ f:write(eol[i])
+ f:write(eol[j])
+ end
+ end
+ -- try long spaced and tabbed lines
+ f:write("\r\n")
+ for i = 0, 255 do
+ f:write(string.char(9))
+ end
+ f:write("\r\n")
+ for i = 0, 255 do
+ f:write(' ')
+ end
+ f:write("\r\n")
+ for i = 0, 255 do
+ f:write(string.char(9),' ')
+ end
+ f:write("\r\n")
+ for i = 0, 255 do
+ f:write(' ',string.char(32))
+ end
+ f:write("\r\n")
+
+ f:close()
+end
+
+local function cleanup_qptest()
+ os.remove(qptest)
+ os.remove(eqptest)
+ os.remove(dqptest)
+end
+
+-- create test file
+local function create_b64test()
+ local f = assert(io.open(b64test, "wb"))
+ local t = {}
+ for j = 1, 100 do
+ for i = 1, 100 do
+ t[i] = math.random(0, 255)
+ end
+ f:write(string.char(unpack(t)))
+ end
+ f:close()
+end
+
+local function encode_b64test()
+ local e1 = mime.encode("base64")
+ local e2 = mime.encode("base64")
+ local e3 = mime.encode("base64")
+ local e4 = mime.encode("base64")
+ local sp4 = mime.wrap()
+ local sp3 = mime.wrap(59)
+ local sp2 = mime.wrap("base64", 30)
+ local sp1 = mime.wrap(27)
+ local chain = ltn12.filter.chain(e1, sp1, e2, sp2, e3, sp3, e4, sp4)
+ transform(b64test, eb64test, chain)
+end
+
+local function decode_b64test()
+ local d1 = named(mime.decode("base64"), "d1")
+ local d2 = named(mime.decode("base64"), "d2")
+ local d3 = named(mime.decode("base64"), "d3")
+ local d4 = named(mime.decode("base64"), "d4")
+ local chain = named(ltn12.filter.chain(d1, d2, d3, d4), "chain")
+ transform(eb64test, db64test, chain)
+end
+
+local function cleanup_b64test()
+ os.remove(b64test)
+ os.remove(eb64test)
+ os.remove(db64test)
+end
+
+local function compare_b64test()
+io.write("testing b64 chained encode: ")
+ compare(b64test, db64test)
+end
+
+local function identity_test()
+io.write("testing identity: ")
+ local chain = named(ltn12.filter.chain(
+ named(mime.encode("quoted-printable"), "1 eq"),
+ named(mime.encode("base64"), "2 eb"),
+ named(mime.decode("base64"), "3 db"),
+ named(mime.decode("quoted-printable"), "4 dq")
+ ), "chain")
+ transform(b64test, eb64test, chain)
+ compare(b64test, eb64test)
+ os.remove(eb64test)
+end
+
+
+local function padcheck(original, encoded)
+ local e = (mime.b64(original))
+ local d = (mime.unb64(encoded))
+ if e ~= encoded then fail("encoding failed") end
+ if d ~= original then fail("decoding failed") end
+end
+
+local function chunkcheck(original, encoded)
+ local len = string.len(original)
+ for i = 0, len do
+ local a = string.sub(original, 1, i)
+ local b = string.sub(original, i+1)
+ local e, r = mime.b64(a, b)
+ local f = (mime.b64(r))
+ if (e .. (f or "") ~= encoded) then fail(e .. (f or "")) end
+ end
+end
+
+local function padding_b64test()
+io.write("testing b64 padding: ")
+ padcheck("a", "YQ==")
+ padcheck("ab", "YWI=")
+ padcheck("abc", "YWJj")
+ padcheck("abcd", "YWJjZA==")
+ padcheck("abcde", "YWJjZGU=")
+ padcheck("abcdef", "YWJjZGVm")
+ padcheck("abcdefg", "YWJjZGVmZw==")
+ padcheck("abcdefgh", "YWJjZGVmZ2g=")
+ padcheck("abcdefghi", "YWJjZGVmZ2hp")
+ padcheck("abcdefghij", "YWJjZGVmZ2hpag==")
+ chunkcheck("abcdefgh", "YWJjZGVmZ2g=")
+ chunkcheck("abcdefghi", "YWJjZGVmZ2hp")
+ chunkcheck("abcdefghij", "YWJjZGVmZ2hpag==")
+ print("ok")
+end
+
+local function test_b64lowlevel()
+io.write("testing b64 low-level: ")
+ local a, b
+ a, b = mime.b64("", "")
+ assert(a == "" and b == "")
+ a, b = mime.b64(nil, "blablabla")
+ assert(a == nil and b == nil)
+ a, b = mime.b64("", nil)
+ assert(a == nil and b == nil)
+ a, b = mime.unb64("", "")
+ assert(a == "" and b == "")
+ a, b = mime.unb64(nil, "blablabla")
+ assert(a == nil and b == nil)
+ a, b = mime.unb64("", nil)
+ assert(a == nil and b == nil)
+ local binary=string.char(0x00,0x44,0x1D,0x14,0x0F,0xF4,0xDA,0x11,0xA9,0x78,0x00,0x14,0x38,0x50,0x60,0xCE)
+ local encoded = mime.b64(binary)
+ local decoded=mime.unb64(encoded)
+ assert(binary == decoded)
+ print("ok")
+end
+
+local t = socket.gettime()
+
+create_b64test()
+identity_test()
+encode_b64test()
+decode_b64test()
+compare_b64test()
+cleanup_b64test()
+padding_b64test()
+test_b64lowlevel()
+
+create_qptest()
+encode_qptest()
+decode_qptest()
+compare_qptest()
+encode_qptest("binary")
+decode_qptest()
+compare_qptest()
+cleanup_qptest()
+
+
+print(string.format("done in %.2fs", socket.gettime() - t))
diff --git a/test/smtptest.lua b/test/smtptest.lua
new file mode 100644
index 0000000..b5380ff
--- /dev/null
+++ b/test/smtptest.lua
@@ -0,0 +1,259 @@
+local sent = {}
+
+local from = "diego@localhost"
+local server = "localhost"
+local rcpt = "luasocket@localhost"
+
+local files = {
+ "/var/spool/mail/luasocket",
+ "/var/spool/mail/luasock1",
+ "/var/spool/mail/luasock2",
+ "/var/spool/mail/luasock3",
+}
+
+local t = socket.time()
+local err
+
+dofile("mbox.lua")
+local parse = mbox.parse
+dofile("testsupport.lua")
+
+local total = function()
+ local t = 0
+ for i = 1, #sent do
+ t = t + sent[i].count
+ end
+ return t
+end
+
+local similar = function(s1, s2)
+ return
+ string.lower(string.gsub(s1, "%s", "")) ==
+ string.lower(string.gsub(s2, "%s", ""))
+end
+
+local fail = function(s)
+ s = s or "failed!"
+ print(s)
+ os.exit()
+end
+
+local readfile = function(name)
+ local f = io.open(name, "r")
+ if not f then
+ fail("unable to open file!")
+ return nil
+ end
+ local s = f:read("*a")
+ f:close()
+ return s
+end
+
+local empty = function()
+ for i,v in ipairs(files) do
+ local f = io.open(v, "w")
+ if not f then
+ fail("unable to open file!")
+ end
+ f:close()
+ end
+end
+
+local get = function()
+ local s = ""
+ for i,v in ipairs(files) do
+ s = s .. "\n" .. readfile(v)
+ end
+ return s
+end
+
+local check_headers = function(sent, got)
+ sent = sent or {}
+ got = got or {}
+ for i,v in pairs(sent) do
+ if not similar(v, got[i]) then fail("header " .. v .. "failed!") end
+ end
+end
+
+local check_body = function(sent, got)
+ sent = sent or ""
+ got = got or ""
+ if not similar(sent, got) then fail("bodies differ!") end
+end
+
+local check = function(sent, m)
+ io.write("checking ", m.headers.title, ": ")
+ for i = 1, #sent do
+ local s = sent[i]
+ if s.title == m.headers.title and s.count > 0 then
+ check_headers(s.headers, m.headers)
+ check_body(s.body, m.body)
+ s.count = s.count - 1
+ print("ok")
+ return
+ end
+ end
+ fail("not found")
+end
+
+local insert = function(sent, message)
+ if type(message.rcpt) == "table" then
+ message.count = #message.rcpt
+ else message.count = 1 end
+ message.headers = message.headers or {}
+ message.headers.title = message.title
+ table.insert(sent, message)
+end
+
+local mark = function()
+ local time = socket.time()
+ return { time = time }
+end
+
+local wait = function(sentinel, n)
+ local to
+ io.write("waiting for ", n, " messages: ")
+ while 1 do
+ local mbox = parse(get())
+ if n == #mbox then break end
+ if socket.time() - sentinel.time > 50 then
+ to = 1
+ break
+ end
+ socket.sleep(1)
+ io.write(".")
+ io.stdout:flush()
+ end
+ if to then fail("timeout")
+ else print("ok") end
+end
+
+local stuffed_body = [[
+This message body needs to be
+stuffed because it has a dot
+.
+by itself on a line.
+Otherwise the mailer would
+think that the dot
+.
+is the end of the message
+and the remaining text would cause
+a lot of trouble.
+]]
+
+insert(sent, {
+ from = from,
+ rcpt = {
+ "luasocket@localhost",
+ "luasock3@dell-diego.cs.princeton.edu",
+ "luasock1@dell-diego.cs.princeton.edu"
+ },
+ body = "multiple rcpt body",
+ title = "multiple rcpt",
+})
+
+insert(sent, {
+ from = from,
+ rcpt = {
+ "luasock2@localhost",
+ "luasock3",
+ "luasock1"
+ },
+ headers = {
+ header1 = "header 1",
+ header2 = "header 2",
+ header3 = "header 3",
+ header4 = "header 4",
+ header5 = "header 5",
+ header6 = "header 6",
+ },
+ body = stuffed_body,
+ title = "complex message",
+})
+
+insert(sent, {
+ from = from,
+ rcpt = rcpt,
+ server = server,
+ body = "simple message body",
+ title = "simple message"
+})
+
+insert(sent, {
+ from = from,
+ rcpt = rcpt,
+ server = server,
+ body = stuffed_body,
+ title = "stuffed message body"
+})
+
+insert(sent, {
+ from = from,
+ rcpt = rcpt,
+ headers = {
+ header1 = "header 1",
+ header2 = "header 2",
+ header3 = "header 3",
+ header4 = "header 4",
+ header5 = "header 5",
+ header6 = "header 6",
+ },
+ title = "multiple headers"
+})
+
+insert(sent, {
+ from = from,
+ rcpt = rcpt,
+ title = "minimum message"
+})
+
+io.write("testing host not found: ")
+local c, e = socket.connect("wrong.host", 25)
+local ret, err = socket.smtp.mail{
+ from = from,
+ rcpt = rcpt,
+ server = "wrong.host"
+}
+if ret or e ~= err then fail("wrong error message")
+else print("ok") end
+
+io.write("testing invalid from: ")
+local ret, err = socket.smtp.mail{
+ from = ' " " (( _ * ',
+ rcpt = rcpt,
+}
+if ret or not err then fail("wrong error message")
+else print(err) end
+
+io.write("testing no rcpt: ")
+local ret, err = socket.smtp.mail{
+ from = from,
+}
+if ret or not err then fail("wrong error message")
+else print(err) end
+
+io.write("clearing mailbox: ")
+empty()
+print("ok")
+
+io.write("sending messages: ")
+for i = 1, #sent do
+ ret, err = socket.smtp.mail(sent[i])
+ if not ret then fail(err) end
+ io.write("+")
+ io.stdout:flush()
+end
+print("ok")
+
+wait(mark(), total())
+
+io.write("parsing mailbox: ")
+local mbox = parse(get())
+print(#mbox .. " messages found!")
+
+for i = 1, #mbox do
+ check(sent, mbox[i])
+end
+
+print("passed all tests")
+print(string.format("done in %.2fs", socket.time() - t))
diff --git a/test/stufftest.lua b/test/stufftest.lua
new file mode 100644
index 0000000..490053f
--- /dev/null
+++ b/test/stufftest.lua
@@ -0,0 +1,21 @@
+local mime = require("mime")
+
+function test_dot(original, right)
+ local result, n = mime.dot(2, original)
+ assert(result == right, "->" .. result .. "<-")
+ print("ok")
+end
+
+function test_stuff(original, right)
+ local result, n = mime.dot(2, original)
+ assert(result == right, "->" .. result .. "<-")
+ print("ok")
+end
+
+test_dot("abc", "abc")
+test_dot("", "")
+test_dot("\r\n", "\r\n")
+test_dot("\r\n.", "\r\n..")
+test_dot(".\r\n.", "..\r\n..")
+test_dot(".\r\n.", "..\r\n..")
+test_dot("abcd.\r\n.", "abcd.\r\n..")
diff --git a/test/tcp-getoptions b/test/tcp-getoptions
new file mode 100755
index 0000000..f9b3d1b
--- /dev/null
+++ b/test/tcp-getoptions
@@ -0,0 +1,41 @@
+#!/usr/bin/env lua
+
+require"socket"
+
+port = 8765
+
+function options(o)
+ print("options for", o)
+
+ for _, opt in ipairs{"keepalive", "reuseaddr", "tcp-nodelay"} do
+ print("getoption", opt, o:getoption(opt))
+ end
+
+ print("getoption", "linger",
+ "on", o:getoption("linger").on,
+ "timeout", o:getoption("linger").timeout)
+end
+
+local m = socket.tcp()
+
+options(m)
+
+assert(m:bind("*", port))
+assert(m:listen())
+
+options(m)
+
+m:close()
+
+local m = socket.bind("*", port)
+
+options(m)
+
+local c = socket.connect("localhost", port)
+
+options(c)
+
+local s = m:accept()
+
+options(s)
+
diff --git a/test/test_bind.lua b/test/test_bind.lua
new file mode 100644
index 0000000..93c42d7
--- /dev/null
+++ b/test/test_bind.lua
@@ -0,0 +1,6 @@
+local socket = require "socket"
+local u = socket.udp() assert(u:setsockname("*", 5088)) u:close()
+local u = socket.udp() assert(u:setsockname("*", 0)) u:close()
+local t = socket.tcp() assert(t:bind("*", 5088)) t:close()
+local t = socket.tcp() assert(t:bind("*", 0)) t:close()
+print("done!")
\ No newline at end of file
diff --git a/test/test_getaddrinfo.lua b/test/test_getaddrinfo.lua
new file mode 100644
index 0000000..4b52ff9
--- /dev/null
+++ b/test/test_getaddrinfo.lua
@@ -0,0 +1,15 @@
+local socket = require "socket"
+local addresses = assert(socket.dns.getaddrinfo("localhost"))
+assert(type(addresses) == 'table')
+
+local ipv4mask = "^%d%d?%d?%.%d%d?%d?%.%d%d?%d?%.%d%d?%d?$"
+
+for i, alt in ipairs(addresses) do
+ if alt.family == 'inet' then
+ assert(type(alt.addr) == 'string')
+ assert(alt.addr:find(ipv4mask))
+ assert(alt.addr == '127.0.0.1')
+ end
+end
+
+print("done!")
diff --git a/test/test_socket_error.lua b/test/test_socket_error.lua
new file mode 100644
index 0000000..9bd0bc7
--- /dev/null
+++ b/test/test_socket_error.lua
@@ -0,0 +1,27 @@
+local socket = require "socket"
+
+local host, port = "127.0.0.1", "5462"
+
+assert(socket.bind(host, port)):close()
+
+local sock = socket.tcp()
+sock:settimeout(0)
+
+local ok, err = sock:connect(host, port)
+assert(not ok)
+assert('timeout' == err)
+
+for i = 1, 10 do
+ -- select pass even if socket has error
+ local _, rec, err = socket.select(nil, {sock}, 1)
+ assert('timeout' == err)
+ assert(not next(rec))
+ err = sock:getoption("error") -- i get 'connection refused' on WinXP
+ if err then
+ print("Passed! Error is '" .. err .. "'.")
+ os.exit(0)
+ end
+end
+
+print("Fail! No error detected!")
+os.exit(1)
diff --git a/test/testclnt.lua b/test/testclnt.lua
new file mode 100644
index 0000000..315783b
--- /dev/null
+++ b/test/testclnt.lua
@@ -0,0 +1,801 @@
+local socket = require"socket"
+
+host = host or "localhost"
+port = port or "8383"
+
+function printf(...)
+ io.stderr:write(string.format(...))
+end
+
+function pass(...)
+ printf(...)
+ io.stderr:write("\n")
+end
+
+function fail(...)
+ io.stderr:write("ERROR: ")
+ printf(...)
+ io.stderr:write("!\n")
+ os.exit()
+end
+
+function warn(...)
+ local s = string.format(...)
+ io.stderr:write("WARNING: ", s, "\n")
+end
+
+function remote(...)
+ local s = string.format(...)
+ s = string.gsub(s, "\n", ";")
+ s = string.gsub(s, "%s+", " ")
+ s = string.gsub(s, "^%s*", "")
+ control:send(s .. "\n")
+ control:receive()
+end
+
+function test(test)
+ io.stderr:write("----------------------------------------------\n",
+ "testing: ", test, "\n",
+ "----------------------------------------------\n")
+end
+
+function check_timeout(tm, sl, elapsed, err, opp, mode, alldone)
+ if tm < sl then
+ if opp == "send" then
+ if not err then warn("must be buffered")
+ elseif err == "timeout" then pass("proper timeout")
+ else fail("unexpected error '%s'", err) end
+ else
+ if err ~= "timeout" then fail("should have timed out")
+ else pass("proper timeout") end
+ end
+ else
+ if mode == "total" then
+ if elapsed > tm then
+ if err ~= "timeout" then fail("should have timed out")
+ else pass("proper timeout") end
+ elseif elapsed < tm then
+ if err then fail(err)
+ else pass("ok") end
+ else
+ if alldone then
+ if err then fail("unexpected error '%s'", err)
+ else pass("ok") end
+ else
+ if err ~= "timeout" then fail(err)
+ else pass("proper timeoutk") end
+ end
+ end
+ else
+ if err then fail(err)
+ else pass("ok") end
+ end
+ end
+end
+
+if not socket._DEBUG then
+ fail("Please define LUASOCKET_DEBUG and recompile LuaSocket")
+end
+
+io.stderr:write("----------------------------------------------\n",
+"LuaSocket Test Procedures\n",
+"----------------------------------------------\n")
+
+start = socket.gettime()
+
+function reconnect()
+ if data then data:close() end
+ remote [[
+ if data then data:close() data = nil end
+ data = server:accept()
+ data:setoption("tcp-nodelay", true)
+ ]]
+ data, err = socket.connect(host, port)
+ if not data then fail(err) end
+ data:setoption("tcp-nodelay", true)
+end
+
+printf("attempting control connection...")
+control, err = socket.connect(host, port)
+if err then fail(err)
+else pass("connected!") end
+control:setoption("tcp-nodelay", true)
+
+------------------------------------------------------------------------
+function test_methods(sock, methods)
+ for _, v in pairs(methods) do
+ if type(sock[v]) ~= "function" then
+ fail(sock.class .. " method '" .. v .. "' not registered")
+ end
+ end
+ pass(sock.class .. " methods are ok")
+end
+
+------------------------------------------------------------------------
+function test_mixed(len)
+ reconnect()
+ io.stderr:write("length " .. len .. ": ")
+ local inter = math.ceil(len/4)
+ local p1 = "unix " .. string.rep("x", inter) .. "line\n"
+ local p2 = "dos " .. string.rep("y", inter) .. "line\r\n"
+ local p3 = "raw " .. string.rep("z", inter) .. "bytes"
+ local p4 = "end" .. string.rep("w", inter) .. "bytes"
+ local bp1, bp2, bp3, bp4
+remote (string.format("str = data:receive(%d)",
+ string.len(p1)+string.len(p2)+string.len(p3)+string.len(p4)))
+ sent, err = data:send(p1..p2..p3..p4)
+ if err then fail(err) end
+remote "data:send(str); data:close()"
+ bp1, err = data:receive()
+ if err then fail(err) end
+ bp2, err = data:receive()
+ if err then fail(err) end
+ bp3, err = data:receive(string.len(p3))
+ if err then fail(err) end
+ bp4, err = data:receive("*a")
+ if err then fail(err) end
+ if bp1.."\n" == p1 and bp2.."\r\n" == p2 and bp3 == p3 and bp4 == p4 then
+ pass("patterns match")
+ else fail("patterns don't match") end
+end
+
+------------------------------------------------------------------------
+if not math.mod then
+ math.mod = math.fmod
+end
+function test_asciiline(len)
+ reconnect()
+ io.stderr:write("length " .. len .. ": ")
+ local str, str10, back, err
+ str = string.rep("x", math.mod(len, 10))
+ str10 = string.rep("aZb.c#dAe?", math.floor(len/10))
+ str = str .. str10
+remote "str = data:receive()"
+ sent, err = data:send(str.."\n")
+ if err then fail(err) end
+remote "data:send(str ..'\\n')"
+ back, err = data:receive()
+ if err then fail(err) end
+ if back == str then pass("lines match")
+ else fail("lines don't match") end
+end
+
+------------------------------------------------------------------------
+function test_rawline(len)
+ reconnect()
+ io.stderr:write("length " .. len .. ": ")
+ local str, str10, back, err
+ str = string.rep(string.char(47), math.mod(len, 10))
+ str10 = string.rep(string.char(120,21,77,4,5,0,7,36,44,100),
+ math.floor(len/10))
+ str = str .. str10
+remote "str = data:receive()"
+ sent, err = data:send(str.."\n")
+ if err then fail(err) end
+remote "data:send(str..'\\n')"
+ back, err = data:receive()
+ if err then fail(err) end
+ if back == str then pass("lines match")
+ else fail("lines don't match") end
+end
+
+------------------------------------------------------------------------
+function test_raw(len)
+ reconnect()
+ io.stderr:write("length " .. len .. ": ")
+ local half = math.floor(len/2)
+ local s1, s2, back, err
+ s1 = string.rep("x", half)
+ s2 = string.rep("y", len-half)
+remote (string.format("str = data:receive(%d)", len))
+ sent, err = data:send(s1)
+ if err then fail(err) end
+ sent, err = data:send(s2)
+ if err then fail(err) end
+remote "data:send(str)"
+ back, err = data:receive(len)
+ if err then fail(err) end
+ if back == s1..s2 then pass("blocks match")
+ else fail("blocks don't match") end
+end
+
+------------------------------------------------------------------------
+function test_totaltimeoutreceive(len, tm, sl)
+ reconnect()
+ local str, err, partial
+ printf("%d bytes, %ds total timeout, %ds pause: ", len, tm, sl)
+ remote (string.format ([[
+ data:settimeout(%d)
+ str = string.rep('a', %d)
+ data:send(str)
+ print('server: sleeping for %ds')
+ socket.sleep(%d)
+ print('server: woke up')
+ data:send(str)
+ ]], 2*tm, len, sl, sl))
+ data:settimeout(tm, "total")
+local t = socket.gettime()
+ str, err, partial, elapsed = data:receive(2*len)
+ check_timeout(tm, sl, elapsed, err, "receive", "total",
+ string.len(str or partial) == 2*len)
+end
+
+------------------------------------------------------------------------
+function test_totaltimeoutsend(len, tm, sl)
+ reconnect()
+ local str, err, total
+ printf("%d bytes, %ds total timeout, %ds pause: ", len, tm, sl)
+ remote (string.format ([[
+ data:settimeout(%d)
+ str = data:receive(%d)
+ print('server: sleeping for %ds')
+ socket.sleep(%d)
+ print('server: woke up')
+ str = data:receive(%d)
+ ]], 2*tm, len, sl, sl, len))
+ data:settimeout(tm, "total")
+ str = string.rep("a", 2*len)
+ total, err, partial, elapsed = data:send(str)
+ check_timeout(tm, sl, elapsed, err, "send", "total",
+ total == 2*len)
+end
+
+------------------------------------------------------------------------
+function test_blockingtimeoutreceive(len, tm, sl)
+ reconnect()
+ local str, err, partial
+ printf("%d bytes, %ds blocking timeout, %ds pause: ", len, tm, sl)
+ remote (string.format ([[
+ data:settimeout(%d)
+ str = string.rep('a', %d)
+ data:send(str)
+ print('server: sleeping for %ds')
+ socket.sleep(%d)
+ print('server: woke up')
+ data:send(str)
+ ]], 2*tm, len, sl, sl))
+ data:settimeout(tm)
+ str, err, partial, elapsed = data:receive(2*len)
+ check_timeout(tm, sl, elapsed, err, "receive", "blocking",
+ string.len(str or partial) == 2*len)
+end
+
+------------------------------------------------------------------------
+function test_blockingtimeoutsend(len, tm, sl)
+ reconnect()
+ local str, err, total
+ printf("%d bytes, %ds blocking timeout, %ds pause: ", len, tm, sl)
+ remote (string.format ([[
+ data:settimeout(%d)
+ str = data:receive(%d)
+ print('server: sleeping for %ds')
+ socket.sleep(%d)
+ print('server: woke up')
+ str = data:receive(%d)
+ ]], 2*tm, len, sl, sl, len))
+ data:settimeout(tm)
+ str = string.rep("a", 2*len)
+ total, err, partial, elapsed = data:send(str)
+ check_timeout(tm, sl, elapsed, err, "send", "blocking",
+ total == 2*len)
+end
+
+------------------------------------------------------------------------
+function empty_connect()
+ printf("empty connect: ")
+ reconnect()
+ if data then data:close() data = nil end
+ remote [[
+ if data then data:close() data = nil end
+ data = server:accept()
+ ]]
+ data, err = socket.connect("", port)
+ if not data then
+ pass("ok")
+ data = socket.connect(host, port)
+ else
+ pass("gethostbyname returns localhost on empty string...")
+ end
+end
+
+------------------------------------------------------------------------
+function isclosed(c)
+ return c:getfd() == -1 or c:getfd() == (2^32-1)
+end
+
+function active_close()
+ reconnect()
+ if isclosed(data) then fail("should not be closed") end
+ data:close()
+ if not isclosed(data) then fail("should be closed") end
+ data = nil
+ local udp = socket.udp()
+ if isclosed(udp) then fail("should not be closed") end
+ udp:close()
+ if not isclosed(udp) then fail("should be closed") end
+ pass("ok")
+end
+
+------------------------------------------------------------------------
+function test_closed()
+ local back, partial, err
+ local str = 'little string'
+ reconnect()
+ printf("trying read detection: ")
+ remote (string.format ([[
+ data:send('%s')
+ data:close()
+ data = nil
+ ]], str))
+ -- try to get a line
+ back, err, partial = data:receive()
+ if not err then fail("should have gotten 'closed'.")
+ elseif err ~= "closed" then fail("got '"..err.."' instead of 'closed'.")
+ elseif str ~= partial then fail("didn't receive partial result.")
+ else pass("graceful 'closed' received") end
+ reconnect()
+ printf("trying write detection: ")
+ remote [[
+ data:close()
+ data = nil
+ ]]
+ total, err, partial = data:send(string.rep("ugauga", 100000))
+ if not err then
+ pass("failed: output buffer is at least %d bytes long!", total)
+ elseif err ~= "closed" then
+ fail("got '"..err.."' instead of 'closed'.")
+ else
+ pass("graceful 'closed' received after %d bytes were sent", partial)
+ end
+end
+
+------------------------------------------------------------------------
+function test_selectbugs()
+ local r, s, e = socket.select(nil, nil, 0.1)
+ assert(type(r) == "table" and type(s) == "table" and
+ (e == "timeout" or e == "error"))
+ pass("both nil: ok")
+ local udp = socket.udp()
+ udp:close()
+ r, s, e = socket.select({ udp }, { udp }, 0.1)
+ assert(type(r) == "table" and type(s) == "table" and
+ (e == "timeout" or e == "error"))
+ pass("closed sockets: ok")
+ e = pcall(socket.select, "wrong", 1, 0.1)
+ assert(e == false, tostring(e))
+ e = pcall(socket.select, {}, 1, 0.1)
+ assert(e == false, tostring(e))
+ pass("invalid input: ok")
+ local toomany = {}
+ for i = 1, socket._SETSIZE+1 do
+ toomany[#toomany+1] = socket.udp()
+ end
+ if #toomany > socket._SETSIZE then
+ local e = pcall(socket.select, toomany, nil, 0.1)
+ assert(e == false, tostring(e))
+ pass("too many sockets (" .. #toomany .. "): ok")
+ else
+ pass("unable to create enough sockets (max was "..#toomany..")")
+ pass("try using ulimit")
+ end
+ for _, c in ipairs(toomany) do c:close() end
+end
+
+------------------------------------------------------------------------
+function accept_timeout()
+ printf("accept with timeout (if it hangs, it failed): ")
+ local s, e = socket.bind("*", 0, 0)
+ assert(s, e)
+ local t = socket.gettime()
+ s:settimeout(1)
+ local c, e = s:accept()
+ assert(not c, "should not accept")
+ assert(e == "timeout", string.format("wrong error message (%s)", e))
+ t = socket.gettime() - t
+ assert(t < 2, string.format("took to long to give up (%gs)", t))
+ s:close()
+ pass("good")
+end
+
+------------------------------------------------------------------------
+function connect_timeout()
+ printf("connect with timeout (if it hangs, it failed!): ")
+ local t = socket.gettime()
+ local c, e = socket.tcp()
+ assert(c, e)
+ c:settimeout(0.1)
+ local t = socket.gettime()
+ local r, e = c:connect("10.0.0.1", 81)
+ assert(not r, "should not connect")
+ assert(socket.gettime() - t < 2, "took too long to give up.")
+ c:close()
+ pass("ok")
+end
+
+------------------------------------------------------------------------
+function accept_errors()
+ printf("not listening: ")
+ local d, e = socket.bind("*", 0)
+ assert(d, e);
+ local c, e = socket.tcp();
+ assert(c, e);
+ d:setfd(c:getfd())
+ d:settimeout(2)
+ local r, e = d:accept()
+ assert(not r and e)
+ pass("ok")
+ printf("not supported: ")
+ local c, e = socket.udp()
+ assert(c, e);
+ d:setfd(c:getfd())
+ local r, e = d:accept()
+ assert(not r and e)
+ pass("ok")
+end
+
+------------------------------------------------------------------------
+function connect_errors()
+ printf("connection refused: ")
+ local c, e = socket.connect("localhost", 1);
+ assert(not c and e)
+ pass("ok")
+ printf("host not found: ")
+ local c, e = socket.connect("host.is.invalid", 1);
+ assert(not c and e, e)
+ pass("ok")
+end
+
+------------------------------------------------------------------------
+function rebind_test()
+ --local c ,c1 = socket.bind("localhost", 0)
+ local c ,c1 = socket.bind("127.0.0.1", 0)
+ if not c then pass ("failed to bind! " .. tostring(c) .. ' ' .. tostring(c1)) return end
+ assert(c,c1)
+
+ local i, p = c:getsockname()
+ local s, e = socket.tcp()
+ assert(s, e)
+ s:setoption("reuseaddr", false)
+ r, e = s:bind("localhost", p)
+ assert(not r, "managed to rebind!")
+ assert(e)
+ pass("ok")
+end
+
+------------------------------------------------------------------------
+function getstats_test()
+ reconnect()
+ local t = 0
+ for i = 1, 25 do
+ local c = math.random(1, 100)
+ remote (string.format ([[
+ str = data:receive(%d)
+ data:send(str)
+ ]], c))
+ data:send(string.rep("a", c))
+ data:receive(c)
+ t = t + c
+ local r, s, a = data:getstats()
+ assert(r == t, "received count failed" .. tostring(r)
+ .. "/" .. tostring(t))
+ assert(s == t, "sent count failed" .. tostring(s)
+ .. "/" .. tostring(t))
+ end
+ pass("ok")
+end
+
+
+------------------------------------------------------------------------
+function test_nonblocking(size)
+ reconnect()
+ printf("testing " .. 2*size .. " bytes: ")
+remote(string.format([[
+ data:send(string.rep("a", %d))
+ socket.sleep(0.5)
+ data:send(string.rep("b", %d) .. "\n")
+]], size, size))
+ local err = "timeout"
+ local part = ""
+ local str
+ data:settimeout(0)
+ while 1 do
+ str, err, part = data:receive("*l", part)
+ if err ~= "timeout" then break end
+ end
+ assert(str == (string.rep("a", size) .. string.rep("b", size)))
+ reconnect()
+remote(string.format([[
+ str = data:receive(%d)
+ socket.sleep(0.5)
+ str = data:receive(2*%d, str)
+ data:send(str)
+]], size, size))
+ data:settimeout(0)
+ local start = 0
+ while 1 do
+ ret, err, start = data:send(str, start+1)
+ if err ~= "timeout" then break end
+ end
+ data:send("\n")
+ data:settimeout(-1)
+ local back = data:receive(2*size)
+ assert(back == str, "'" .. back .. "' vs '" .. str .. "'")
+ pass("ok")
+end
+
+------------------------------------------------------------------------
+function test_readafterclose()
+ local back, partial, err
+ local str = 'little string'
+ reconnect()
+ printf("trying repeated '*a' pattern")
+ remote (string.format ([[
+ data:send('%s')
+ data:close()
+ data = nil
+ ]], str))
+ back, err, partial = data:receive("*a")
+ assert(back == str, "unexpected data read")
+ back, err, partial = data:receive("*a")
+ assert(back == nil and err == "closed", "should have returned 'closed'")
+ pass("ok")
+ reconnect()
+ printf("trying active close before '*a'")
+ remote (string.format ([[
+ data:close()
+ data = nil
+ ]]))
+ data:close()
+ back, err, partial = data:receive("*a")
+ assert(back == nil and err == "closed", "should have returned 'closed'")
+ pass("ok")
+ reconnect()
+ printf("trying active close before '*l'")
+ remote (string.format ([[
+ data:close()
+ data = nil
+ ]]))
+ data:close()
+ back, err, partial = data:receive()
+ assert(back == nil and err == "closed", "should have returned 'closed'")
+ pass("ok")
+ reconnect()
+ printf("trying active close before raw 1")
+ remote (string.format ([[
+ data:close()
+ data = nil
+ ]]))
+ data:close()
+ back, err, partial = data:receive(1)
+ assert(back == nil and err == "closed", "should have returned 'closed'")
+ pass("ok")
+ reconnect()
+ printf("trying active close before raw 0")
+ remote (string.format ([[
+ data:close()
+ data = nil
+ ]]))
+ data:close()
+ back, err, partial = data:receive(0)
+ assert(back == nil and err == "closed", "should have returned 'closed'")
+ pass("ok")
+end
+
+------------------------------------------------------------------------
+function test_writeafterclose()
+ local str = 'little string'
+ reconnect()
+ remote (string.format ([[
+ data:close()
+ data = nil
+ ]]))
+ local sent, err, errsent
+ while not err do
+ sent, err, errsent, time = data:send(str)
+ end
+ assert(err == "closed", "should have returned 'closed'")
+ pass("ok")
+end
+
+------------------------------------------------------------------------
+
+function test_partialrecv()
+ local str = 'little string'
+ reconnect()
+remote([[
+ data:send("7890")
+]])
+ data:settimeout(1)
+ back, err = data:receive(10, "123456")
+ assert(back == "1234567890", "failed on exact mixed length")
+ back, err = data:receive(8, "87654321")
+ assert(back == "87654321", "failed on exact length")
+ back, err = data:receive(4, "87654321")
+ assert(back == "87654321", "failed on smaller length")
+ pass("ok")
+end
+
+------------------------------------------------------------------------
+test("method registration")
+
+local tcp_methods = {
+ "accept",
+ "bind",
+ "close",
+ "connect",
+ "dirty",
+ "getfamily",
+ "getfd",
+ "getoption",
+ "getpeername",
+ "getsockname",
+ "getstats",
+ "setstats",
+ "listen",
+ "receive",
+ "send",
+ "setfd",
+ "setoption",
+ "setpeername",
+ "setsockname",
+ "settimeout",
+ "shutdown",
+}
+test_methods(socket.tcp(), tcp_methods)
+do local sock = socket.tcp6()
+if sock then test_methods(socket.tcp6(), tcp_methods)
+else io.stderr:write("Warning! IPv6 does not support!\n") end
+end
+
+local udp_methods = {
+ "close",
+ "dirty",
+ "getfamily",
+ "getfd",
+ "getoption",
+ "getpeername",
+ "getsockname",
+ "receive",
+ "receivefrom",
+ "send",
+ "sendto",
+ "setfd",
+ "setoption",
+ "setpeername",
+ "setsockname",
+ "settimeout"
+}
+
+
+------------------------------------------------------------------------
+test_methods(socket.udp(), udp_methods)
+do local sock = socket.tcp6()
+if sock then test_methods(socket.udp6(), udp_methods)
+else io.stderr:write("Warning! IPv6 does not support!\n") end
+end
+
+test("partial receive")
+test_partialrecv()
+
+test("select function")
+test_selectbugs()
+
+test("read after close")
+test_readafterclose()
+
+test("write after close")
+test_writeafterclose()
+
+test("connect function")
+connect_timeout()
+empty_connect()
+connect_errors()
+
+test("rebinding: ")
+rebind_test()
+
+test("active close: ")
+active_close()
+
+test("closed connection detection: ")
+test_closed()
+
+test("accept function: ")
+accept_timeout()
+accept_errors()
+
+test("getstats test")
+getstats_test()
+
+test("character line")
+test_asciiline(1)
+test_asciiline(17)
+test_asciiline(200)
+test_asciiline(4091)
+test_asciiline(80199)
+test_asciiline(8000000)
+test_asciiline(80199)
+test_asciiline(4091)
+test_asciiline(200)
+test_asciiline(17)
+test_asciiline(1)
+
+test("mixed patterns")
+test_mixed(1)
+test_mixed(17)
+test_mixed(200)
+test_mixed(4091)
+test_mixed(801990)
+test_mixed(4091)
+test_mixed(200)
+test_mixed(17)
+test_mixed(1)
+
+test("binary line")
+test_rawline(1)
+test_rawline(17)
+test_rawline(200)
+test_rawline(4091)
+test_rawline(80199)
+test_rawline(8000000)
+test_rawline(80199)
+test_rawline(4091)
+test_rawline(200)
+test_rawline(17)
+test_rawline(1)
+
+test("raw transfer")
+test_raw(1)
+test_raw(17)
+test_raw(200)
+test_raw(4091)
+test_raw(80199)
+test_raw(8000000)
+test_raw(80199)
+test_raw(4091)
+test_raw(200)
+test_raw(17)
+test_raw(1)
+
+test("non-blocking transfer")
+test_nonblocking(1)
+test_nonblocking(17)
+test_nonblocking(200)
+test_nonblocking(4091)
+test_nonblocking(80199)
+test_nonblocking(800000)
+test_nonblocking(80199)
+test_nonblocking(4091)
+test_nonblocking(200)
+test_nonblocking(17)
+test_nonblocking(1)
+
+test("total timeout on send")
+test_totaltimeoutsend(800091, 1, 3)
+test_totaltimeoutsend(800091, 2, 3)
+test_totaltimeoutsend(800091, 5, 2)
+test_totaltimeoutsend(800091, 3, 1)
+
+test("total timeout on receive")
+test_totaltimeoutreceive(800091, 1, 3)
+test_totaltimeoutreceive(800091, 2, 3)
+test_totaltimeoutreceive(800091, 3, 2)
+test_totaltimeoutreceive(800091, 3, 1)
+
+test("blocking timeout on send")
+test_blockingtimeoutsend(800091, 1, 3)
+test_blockingtimeoutsend(800091, 2, 3)
+test_blockingtimeoutsend(800091, 3, 2)
+test_blockingtimeoutsend(800091, 3, 1)
+
+test("blocking timeout on receive")
+test_blockingtimeoutreceive(800091, 1, 3)
+test_blockingtimeoutreceive(800091, 2, 3)
+test_blockingtimeoutreceive(800091, 3, 2)
+test_blockingtimeoutreceive(800091, 3, 1)
+
+test("shutting server down")
+reconnect()
+remote("os.exit()")
+
+test(string.format("done in %.2fs", socket.gettime() - start))
diff --git a/test/testmesg.lua b/test/testmesg.lua
new file mode 100644
index 0000000..135a008
--- /dev/null
+++ b/test/testmesg.lua
@@ -0,0 +1,96 @@
+-- load the smtp support and its friends
+local smtp = require("socket.smtp")
+local mime = require("mime")
+local ltn12 = require("ltn12")
+
+function filter(s)
+ if s then io.write(s) end
+ return s
+end
+
+source = smtp.message {
+ headers = { ['content-type'] = 'multipart/alternative' },
+ body = {
+ [1] = {
+ headers = { ['Content-type'] = 'text/html' },
+ body = " Hi, there... "
+ },
+ [2] = {
+ headers = { ['content-type'] = 'text/plain' },
+ body = "Hi, there..."
+ }
+ }
+}
+
+r, e = smtp.send{
+ rcpt = {"",
+ "" },
+ from = "",
+ source = ltn12.source.chain(source, filter),
+ --server = "mail.cs.princeton.edu"
+ server = "localhost",
+ port = 2525
+}
+
+print(r, e)
+
+-- creates a source to send a message with two parts. The first part is
+-- plain text, the second part is a PNG image, encoded as base64.
+source = smtp.message{
+ headers = {
+ -- Remember that headers are *ignored* by smtp.send.
+ from = "Sicrano ",
+ to = "Fulano ",
+ subject = "Here is a message with attachments"
+ },
+ body = {
+ preamble = "If your client doesn't understand attachments, \r\n" ..
+ "it will still display the preamble and the epilogue.\r\n" ..
+ "Preamble might show up even in a MIME enabled client.",
+ -- first part: No headers means plain text, us-ascii.
+ -- The mime.eol low-level filter normalizes end-of-line markers.
+ [1] = {
+ body = mime.eol(0, [[
+ Lines in a message body should always end with CRLF.
+ The smtp module will *NOT* perform translation. It will
+ perform necessary stuffing, though.
+ ]])
+ },
+ -- second part: Headers describe content the to be an image,
+ -- sent under the base64 transfer content encoding.
+ -- Notice that nothing happens until the message is sent. Small
+ -- chunks are loaded into memory and translation happens on the fly.
+ [2] = {
+ headers = {
+ ["ConTenT-tYpE"] = 'image/png; name="luasocket.png"',
+ ["content-disposition"] = 'attachment; filename="luasocket.png"',
+ ["content-description"] = 'our logo',
+ ["content-transfer-encoding"] = "BASE64"
+ },
+ body = ltn12.source.chain(
+ ltn12.source.file(io.open("luasocket.png", "rb")),
+ ltn12.filter.chain(
+ mime.encode("base64"),
+ mime.wrap()
+ )
+ )
+ },
+ epilogue = "This might also show up, but after the attachments"
+ }
+}
+
+
+r, e = smtp.send{
+ rcpt = {"",
+ "" },
+ from = "",
+ source = ltn12.source.chain(source, filter),
+ --server = "mail.cs.princeton.edu",
+ --port = 25
+ server = "localhost",
+ port = 2525
+}
+
+print(r, e)
+
+
diff --git a/test/testsrvr.lua b/test/testsrvr.lua
new file mode 100644
index 0000000..72b93ab
--- /dev/null
+++ b/test/testsrvr.lua
@@ -0,0 +1,20 @@
+socket = require("socket");
+host = host or "localhost";
+port = port or "8383";
+server = assert(socket.bind(host, port));
+ack = "\n";
+while 1 do
+ print("server: waiting for client connection...");
+ control = assert(server:accept());
+ while 1 do
+ command, emsg = control:receive();
+ if emsg == "closed" then
+ control:close()
+ break
+ end
+ assert(command, emsg)
+ assert(control:send(ack));
+ print(command);
+ ((loadstring or load)(command))();
+ end
+end
diff --git a/test/testsupport.lua b/test/testsupport.lua
new file mode 100644
index 0000000..b986088
--- /dev/null
+++ b/test/testsupport.lua
@@ -0,0 +1,37 @@
+function readfile(name)
+ local f = io.open(name, "rb")
+ if not f then return nil end
+ local s = f:read("*a")
+ f:close()
+ return s
+end
+
+function similar(s1, s2)
+ return string.lower(string.gsub(s1 or "", "%s", "")) ==
+ string.lower(string.gsub(s2 or "", "%s", ""))
+end
+
+function fail(msg)
+ msg = msg or "failed"
+ error(msg, 2)
+end
+
+function compare(input, output)
+ local original = readfile(input)
+ local recovered = readfile(output)
+ if original ~= recovered then fail("comparison failed")
+ else print("ok") end
+end
+
+local G = _G
+local set = rawset
+local warn = print
+
+local setglobal = function(table, key, value)
+ warn("changed " .. key)
+ set(table, key, value)
+end
+
+setmetatable(G, {
+ __newindex = setglobal
+})
diff --git a/test/tftptest.lua b/test/tftptest.lua
new file mode 100644
index 0000000..35078e8
--- /dev/null
+++ b/test/tftptest.lua
@@ -0,0 +1,20 @@
+-- load tftpclnt.lua
+local tftp = require("socket.tftp")
+
+-- needs tftp server running on localhost, with root pointing to
+-- a directory with index.html in it
+
+function readfile(file)
+ local f = io.open(file, "r")
+ if not f then return nil end
+ local a = f:read("*a")
+ f:close()
+ return a
+end
+
+host = host or "diego.student.princeton.edu"
+retrieved, err = tftp.get("tftp://" .. host .."/index.html")
+assert(not err, err)
+original = readfile("test/index.html")
+assert(original == retrieved, "files differ!")
+print("passed")
diff --git a/test/udp-zero-length-send b/test/udp-zero-length-send
new file mode 100755
index 0000000..a594944
--- /dev/null
+++ b/test/udp-zero-length-send
@@ -0,0 +1,25 @@
+#!/usr/bin/lua
+
+--[[
+Show that luasocket returns an error message on zero-length UDP sends,
+even though the send is valid, and in fact the UDP packet is sent
+to the peer:
+
+% sudo tcpdump -i lo -n
+tcpdump: verbose output suppressed, use -v or -vv for full protocol decode
+listening on lo, link-type EN10MB (Ethernet), capture size 65535 bytes
+13:40:16.652808 IP 127.0.0.1.56573 > 127.0.0.1.5432: UDP, length 0
+
+]]
+
+require"socket"
+
+s = assert(socket.udp())
+r = assert(socket.udp())
+assert(r:setsockname("*", 5432))
+assert(s:setpeername("127.0.0.1", 5432))
+
+ssz, emsg = s:send("")
+
+print(ssz == 0 and "OK" or "FAIL",[[send:("")]], ssz, emsg)
+
diff --git a/test/udp-zero-length-send-recv b/test/udp-zero-length-send-recv
new file mode 100755
index 0000000..541efd4
--- /dev/null
+++ b/test/udp-zero-length-send-recv
@@ -0,0 +1,37 @@
+#!/usr/bin/lua
+
+--[[
+Show that luasocket returns an error message on zero-length UDP sends,
+even though the send is valid, and in fact the UDP packet is sent
+to the peer:
+
+% sudo tcpdump -i lo -n
+tcpdump: verbose output suppressed, use -v or -vv for full protocol decode
+listening on lo, link-type EN10MB (Ethernet), capture size 65535 bytes
+13:40:16.652808 IP 127.0.0.1.56573 > 127.0.0.1.5432: UDP, length 0
+
+]]
+
+require"socket"
+
+s = assert(socket.udp())
+r = assert(socket.udp())
+assert(r:setsockname("*", 5432))
+assert(s:setpeername("127.0.0.1", 5432))
+
+ok, emsg = s:send("")
+if ok ~= 0 then
+ print("send of zero failed with:", ok, emsg)
+end
+
+assert(r:settimeout(2))
+
+ok, emsg = r:receive()
+
+if not ok or string.len(ok) ~= 0 then
+ print("fail - receive of zero failed with:", ok, emsg)
+ os.exit(1)
+end
+
+print"ok"
+
diff --git a/test/udpconnectclnt.lua b/test/udpconnectclnt.lua
new file mode 100644
index 0000000..effe13a
--- /dev/null
+++ b/test/udpconnectclnt.lua
@@ -0,0 +1,19 @@
+local socket = require"socket"
+local udp = socket.udp
+local localhost = "127.0.0.1"
+local port = arg[1]
+
+se = udp(); se:setoption("reuseaddr", true)
+se:setsockname(localhost, 5062)
+print("se", se:getsockname())
+sc = udp(); sc:setoption("reuseaddr", true)
+sc:setsockname(localhost, 5061)
+print("sc", sc:getsockname())
+
+se:sendto("this is a test from se", localhost, port)
+socket.sleep(1)
+sc:sendto("this is a test from sc", localhost, port)
+socket.sleep(1)
+se:sendto("this is a test from se", localhost, port)
+socket.sleep(1)
+sc:sendto("this is a test from sc", localhost, port)
diff --git a/test/udpconnectsrvr.lua b/test/udpconnectsrvr.lua
new file mode 100644
index 0000000..5a9772e
--- /dev/null
+++ b/test/udpconnectsrvr.lua
@@ -0,0 +1,16 @@
+local socket = require"socket"
+local udp = socket.udp
+local localhost = "127.0.0.1"
+local s = assert(udp())
+assert(tostring(s):find("udp{unconnected}"))
+print("setpeername", s:setpeername(localhost, 5061))
+print("getsockname", s:getsockname())
+assert(tostring(s):find("udp{connected}"))
+print(s:receive())
+print("setpeername", s:setpeername("*"))
+print("getsockname", s:getsockname())
+s:sendto("a", localhost, 12345)
+print("getsockname", s:getsockname())
+assert(tostring(s):find("udp{unconnected}"))
+print(s:receivefrom())
+s:close()
diff --git a/test/unixclnt.lua b/test/unixclnt.lua
new file mode 100644
index 0000000..5171535
--- /dev/null
+++ b/test/unixclnt.lua
@@ -0,0 +1,8 @@
+socket = require"socket"
+socket.unix = require"socket.unix"
+c = assert(socket.unix())
+assert(c:connect("/tmp/foo"))
+while 1 do
+ local l = io.read()
+ assert(c:send(l .. "\n"))
+end
diff --git a/test/unixsrvr.lua b/test/unixsrvr.lua
new file mode 100644
index 0000000..81b9c99
--- /dev/null
+++ b/test/unixsrvr.lua
@@ -0,0 +1,9 @@
+ socket = require"socket"
+ socket.unix = require"socket.unix"
+ u = assert(socket.unix())
+ assert(u:bind("/tmp/foo"))
+ assert(u:listen())
+ c = assert(u:accept())
+ while 1 do
+ print(assert(c:receive()))
+ end
diff --git a/test/upload.html b/test/upload.html
new file mode 100644
index 0000000..b4674a8
--- /dev/null
+++ b/test/upload.html
@@ -0,0 +1,15 @@
+
+
+POST test
+
+
+
+
+
+
diff --git a/test/urltest.lua b/test/urltest.lua
new file mode 100644
index 0000000..32cb348
--- /dev/null
+++ b/test/urltest.lua
@@ -0,0 +1,635 @@
+local socket = require("socket")
+socket.url = require("socket.url")
+dofile("testsupport.lua")
+
+local check_build_url = function(parsed)
+ local built = socket.url.build(parsed)
+ if built ~= parsed.url then
+ print("built is different from expected")
+ print(built)
+ print(expected)
+ os.exit()
+ end
+end
+
+local check_protect = function(parsed, path, unsafe)
+ local built = socket.url.build_path(parsed, unsafe)
+ if built ~= path then
+ print(built, path)
+ print("path composition failed.")
+ os.exit()
+ end
+end
+
+local check_invert = function(url)
+ local parsed = socket.url.parse(url)
+ parsed.path = socket.url.build_path(socket.url.parse_path(parsed.path))
+ local rebuilt = socket.url.build(parsed)
+ if rebuilt ~= url then
+ print(url, rebuilt)
+ print("original and rebuilt are different")
+ os.exit()
+ end
+end
+
+local check_parse_path = function(path, expect)
+ local parsed = socket.url.parse_path(path)
+ for i = 1, math.max(#parsed, #expect) do
+ if parsed[i] ~= expect[i] then
+ print(path)
+ os.exit()
+ end
+ end
+ if expect.is_directory ~= parsed.is_directory then
+ print(path)
+ print("is_directory mismatch")
+ os.exit()
+ end
+ if expect.is_absolute ~= parsed.is_absolute then
+ print(path)
+ print("is_absolute mismatch")
+ os.exit()
+ end
+ local built = socket.url.build_path(expect)
+ if built ~= path then
+ print(built, path)
+ print("path composition failed.")
+ os.exit()
+ end
+end
+
+local check_absolute_url = function(base, relative, absolute)
+ local res = socket.url.absolute(base, relative)
+ if res ~= absolute then
+ io.write("absolute: In test for '", relative, "' expected '",
+ absolute, "' but got '", res, "'\n")
+ os.exit()
+ end
+end
+
+local check_parse_url = function(gaba)
+ local url = gaba.url
+ gaba.url = nil
+ local parsed = socket.url.parse(url)
+ for i, v in pairs(gaba) do
+ if v ~= parsed[i] then
+ io.write("parse: In test for '", url, "' expected ", i, " = '",
+ v, "' but got '", tostring(parsed[i]), "'\n")
+ for i,v in pairs(parsed) do print(i,v) end
+ os.exit()
+ end
+ end
+ for i, v in pairs(parsed) do
+ if v ~= gaba[i] then
+ io.write("parse: In test for '", url, "' expected ", i, " = '",
+ tostring(gaba[i]), "' but got '", v, "'\n")
+ for i,v in pairs(parsed) do print(i,v) end
+ os.exit()
+ end
+ end
+end
+
+print("testing URL parsing")
+check_parse_url{
+ url = "scheme://userinfo@host:port/path;params?query#fragment",
+ scheme = "scheme",
+ authority = "userinfo@host:port",
+ host = "host",
+ port = "port",
+ userinfo = "userinfo",
+ user = "userinfo",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = "fragment"
+}
+
+check_parse_url{
+ url = "scheme://user:password@host:port/path;params?query#fragment",
+ scheme = "scheme",
+ authority = "user:password@host:port",
+ host = "host",
+ port = "port",
+ userinfo = "user:password",
+ user = "user",
+ password = "password",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = "fragment",
+}
+
+check_parse_url{
+ url = "scheme://userinfo@host:port/path;params?query#",
+ scheme = "scheme",
+ authority = "userinfo@host:port",
+ host = "host",
+ port = "port",
+ userinfo = "userinfo",
+ user = "userinfo",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = ""
+}
+
+check_parse_url{
+ url = "scheme://userinfo@host:port/path;params?#fragment",
+ scheme = "scheme",
+ authority = "userinfo@host:port",
+ host = "host",
+ port = "port",
+ userinfo = "userinfo",
+ user = "userinfo",
+ path = "/path",
+ params = "params",
+ query = "",
+ fragment = "fragment"
+}
+
+check_parse_url{
+ url = "scheme://userinfo@host:port/path;params#fragment",
+ scheme = "scheme",
+ authority = "userinfo@host:port",
+ host = "host",
+ port = "port",
+ userinfo = "userinfo",
+ user = "userinfo",
+ path = "/path",
+ params = "params",
+ fragment = "fragment"
+}
+
+check_parse_url{
+ url = "scheme://userinfo@host:port/path;?query#fragment",
+ scheme = "scheme",
+ authority = "userinfo@host:port",
+ host = "host",
+ port = "port",
+ userinfo = "userinfo",
+ user = "userinfo",
+ path = "/path",
+ params = "",
+ query = "query",
+ fragment = "fragment"
+}
+
+check_parse_url{
+ url = "scheme://userinfo@host:port/path?query#fragment",
+ scheme = "scheme",
+ authority = "userinfo@host:port",
+ host = "host",
+ port = "port",
+ userinfo = "userinfo",
+ user = "userinfo",
+ path = "/path",
+ query = "query",
+ fragment = "fragment"
+}
+
+check_parse_url{
+ url = "scheme://userinfo@host:port/;params?query#fragment",
+ scheme = "scheme",
+ authority = "userinfo@host:port",
+ host = "host",
+ port = "port",
+ userinfo = "userinfo",
+ user = "userinfo",
+ path = "/",
+ params = "params",
+ query = "query",
+ fragment = "fragment"
+}
+
+check_parse_url{
+ url = "scheme://userinfo@host:port",
+ scheme = "scheme",
+ authority = "userinfo@host:port",
+ host = "host",
+ port = "port",
+ userinfo = "userinfo",
+ user = "userinfo",
+}
+
+check_parse_url{
+ url = "//userinfo@host:port/path;params?query#fragment",
+ authority = "userinfo@host:port",
+ host = "host",
+ port = "port",
+ userinfo = "userinfo",
+ user = "userinfo",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = "fragment"
+}
+
+check_parse_url{
+ url = "//userinfo@host:port/path",
+ authority = "userinfo@host:port",
+ host = "host",
+ port = "port",
+ userinfo = "userinfo",
+ user = "userinfo",
+ path = "/path",
+}
+
+check_parse_url{
+ url = "//userinfo@host/path",
+ authority = "userinfo@host",
+ host = "host",
+ userinfo = "userinfo",
+ user = "userinfo",
+ path = "/path",
+}
+
+check_parse_url{
+ url = "//user:password@host/path",
+ authority = "user:password@host",
+ host = "host",
+ userinfo = "user:password",
+ password = "password",
+ user = "user",
+ path = "/path",
+}
+
+check_parse_url{
+ url = "//user:@host/path",
+ authority = "user:@host",
+ host = "host",
+ userinfo = "user:",
+ password = "",
+ user = "user",
+ path = "/path",
+}
+
+check_parse_url{
+ url = "//user@host:port/path",
+ authority = "user@host:port",
+ host = "host",
+ userinfo = "user",
+ user = "user",
+ port = "port",
+ path = "/path",
+}
+
+check_parse_url{
+ url = "//host:port/path",
+ authority = "host:port",
+ port = "port",
+ host = "host",
+ path = "/path",
+}
+
+check_parse_url{
+ url = "//host/path",
+ authority = "host",
+ host = "host",
+ path = "/path",
+}
+
+check_parse_url{
+ url = "//host",
+ authority = "host",
+ host = "host",
+}
+
+check_parse_url{
+ url = "/path",
+ path = "/path",
+}
+
+check_parse_url{
+ url = "path",
+ path = "path",
+}
+
+-- IPv6 tests
+
+check_parse_url{
+ url = "http://[FEDC:BA98:7654:3210:FEDC:BA98:7654:3210]:80/index.html",
+ scheme = "http",
+ host = "FEDC:BA98:7654:3210:FEDC:BA98:7654:3210",
+ authority = "[FEDC:BA98:7654:3210:FEDC:BA98:7654:3210]:80",
+ port = "80",
+ path = "/index.html"
+}
+
+check_parse_url{
+ url = "http://[1080:0:0:0:8:800:200C:417A]/index.html",
+ scheme = "http",
+ host = "1080:0:0:0:8:800:200C:417A",
+ authority = "[1080:0:0:0:8:800:200C:417A]",
+ path = "/index.html"
+}
+
+check_parse_url{
+ url = "http://[3ffe:2a00:100:7031::1]",
+ scheme = "http",
+ host = "3ffe:2a00:100:7031::1",
+ authority = "[3ffe:2a00:100:7031::1]",
+}
+
+check_parse_url{
+ url = "http://[1080::8:800:200C:417A]/foo",
+ scheme = "http",
+ host = "1080::8:800:200C:417A",
+ authority = "[1080::8:800:200C:417A]",
+ path = "/foo"
+}
+
+check_parse_url{
+ url = "http://[::192.9.5.5]/ipng",
+ scheme = "http",
+ host = "::192.9.5.5",
+ authority = "[::192.9.5.5]",
+ path = "/ipng"
+}
+
+check_parse_url{
+ url = "http://[::FFFF:129.144.52.38]:80/index.html",
+ scheme = "http",
+ host = "::FFFF:129.144.52.38",
+ port = "80",
+ authority = "[::FFFF:129.144.52.38]:80",
+ path = "/index.html"
+}
+
+check_parse_url{
+ url = "http://[2010:836B:4179::836B:4179]",
+ scheme = "http",
+ host = "2010:836B:4179::836B:4179",
+ authority = "[2010:836B:4179::836B:4179]",
+}
+
+check_parse_url{
+ url = "//userinfo@[::FFFF:129.144.52.38]:port/path;params?query#fragment",
+ authority = "userinfo@[::FFFF:129.144.52.38]:port",
+ host = "::FFFF:129.144.52.38",
+ port = "port",
+ userinfo = "userinfo",
+ user = "userinfo",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = "fragment"
+}
+
+check_parse_url{
+ url = "scheme://user:password@[::192.9.5.5]:port/path;params?query#fragment",
+ scheme = "scheme",
+ authority = "user:password@[::192.9.5.5]:port",
+ host = "::192.9.5.5",
+ port = "port",
+ userinfo = "user:password",
+ user = "user",
+ password = "password",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = "fragment"
+}
+
+print("testing URL building")
+check_build_url {
+ url = "scheme://user:password@host:port/path;params?query#fragment",
+ scheme = "scheme",
+ host = "host",
+ port = "port",
+ user = "user",
+ password = "password",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = "fragment"
+}
+
+check_build_url{
+ url = "//userinfo@[::FFFF:129.144.52.38]:port/path;params?query#fragment",
+ host = "::FFFF:129.144.52.38",
+ port = "port",
+ user = "userinfo",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = "fragment"
+}
+
+check_build_url{
+ url = "scheme://user:password@[::192.9.5.5]:port/path;params?query#fragment",
+ scheme = "scheme",
+ host = "::192.9.5.5",
+ port = "port",
+ user = "user",
+ password = "password",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = "fragment"
+}
+
+check_build_url {
+ url = "scheme://user:password@host/path;params?query#fragment",
+ scheme = "scheme",
+ host = "host",
+ user = "user",
+ password = "password",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = "fragment"
+}
+
+check_build_url {
+ url = "scheme://user@host/path;params?query#fragment",
+ scheme = "scheme",
+ host = "host",
+ user = "user",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = "fragment"
+}
+
+check_build_url {
+ url = "scheme://host/path;params?query#fragment",
+ scheme = "scheme",
+ host = "host",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = "fragment"
+}
+
+check_build_url {
+ url = "scheme://host/path;params#fragment",
+ scheme = "scheme",
+ host = "host",
+ path = "/path",
+ params = "params",
+ fragment = "fragment"
+}
+
+check_build_url {
+ url = "scheme://host/path#fragment",
+ scheme = "scheme",
+ host = "host",
+ path = "/path",
+ fragment = "fragment"
+}
+
+check_build_url {
+ url = "scheme://host/path",
+ scheme = "scheme",
+ host = "host",
+ path = "/path",
+}
+
+check_build_url {
+ url = "//host/path",
+ host = "host",
+ path = "/path",
+}
+
+check_build_url {
+ url = "/path",
+ path = "/path",
+}
+
+check_build_url {
+ url = "scheme://user:password@host:port/path;params?query#fragment",
+ scheme = "scheme",
+ host = "host",
+ port = "port",
+ user = "user",
+ userinfo = "not used",
+ password = "password",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = "fragment"
+}
+
+check_build_url {
+ url = "scheme://user:password@host:port/path;params?query#fragment",
+ scheme = "scheme",
+ host = "host",
+ port = "port",
+ user = "user",
+ userinfo = "not used",
+ authority = "not used",
+ password = "password",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = "fragment"
+}
+
+check_build_url {
+ url = "scheme://user:password@host:port/path;params?query#fragment",
+ scheme = "scheme",
+ host = "host",
+ port = "port",
+ userinfo = "user:password",
+ authority = "not used",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = "fragment"
+}
+
+check_build_url {
+ url = "scheme://user:password@host:port/path;params?query#fragment",
+ scheme = "scheme",
+ authority = "user:password@host:port",
+ path = "/path",
+ params = "params",
+ query = "query",
+ fragment = "fragment"
+}
+
+-- standard RFC tests
+print("testing absolute resolution")
+check_absolute_url("http://a/b/c/d;p?q#f", "g:h", "g:h")
+check_absolute_url("http://a/b/c/d;p?q#f", "g", "http://a/b/c/g")
+check_absolute_url("http://a/b/c/d;p?q#f", "./g", "http://a/b/c/g")
+check_absolute_url("http://a/b/c/d;p?q#f", "g/", "http://a/b/c/g/")
+check_absolute_url("http://a/b/c/d;p?q#f", "/g", "http://a/g")
+check_absolute_url("http://a/b/c/d;p?q#f", "//g", "http://g")
+check_absolute_url("http://a/b/c/d;p?q#f", "?y", "http://a/b/c/d;p?y")
+check_absolute_url("http://a/b/c/d;p?q#f", "g?y", "http://a/b/c/g?y")
+check_absolute_url("http://a/b/c/d;p?q#f", "g?y/./x", "http://a/b/c/g?y/./x")
+check_absolute_url("http://a/b/c/d;p?q#f", "#s", "http://a/b/c/d;p?q#s")
+check_absolute_url("http://a/b/c/d;p?q#f", "g#s", "http://a/b/c/g#s")
+check_absolute_url("http://a/b/c/d;p?q#f", "g#s/./x", "http://a/b/c/g#s/./x")
+check_absolute_url("http://a/b/c/d;p?q#f", "g?y#s", "http://a/b/c/g?y#s")
+check_absolute_url("http://a/b/c/d;p?q#f", ";x", "http://a/b/c/d;x")
+check_absolute_url("http://a/b/c/d;p?q#f", "g;x", "http://a/b/c/g;x")
+check_absolute_url("http://a/b/c/d;p?q#f", "g;x?y#s", "http://a/b/c/g;x?y#s")
+check_absolute_url("http://a/b/c/d;p?q#f", ".", "http://a/b/c/")
+check_absolute_url("http://a/b/c/d;p?q#f", "./", "http://a/b/c/")
+check_absolute_url("http://a/b/c/d;p?q#f", "..", "http://a/b/")
+check_absolute_url("http://a/b/c/d;p?q#f", "../", "http://a/b/")
+check_absolute_url("http://a/b/c/d;p?q#f", "../g", "http://a/b/g")
+check_absolute_url("http://a/b/c/d;p?q#f", "../..", "http://a/")
+check_absolute_url("http://a/b/c/d;p?q#f", "../../", "http://a/")
+check_absolute_url("http://a/b/c/d;p?q#f", "../../g", "http://a/g")
+check_absolute_url("http://a/b/c/d;p?q#f", "", "http://a/b/c/d;p?q#f")
+check_absolute_url("http://a/b/c/d;p?q#f", "/./g", "http://a/./g")
+check_absolute_url("http://a/b/c/d;p?q#f", "/../g", "http://a/../g")
+check_absolute_url("http://a/b/c/d;p?q#f", "g.", "http://a/b/c/g.")
+check_absolute_url("http://a/b/c/d;p?q#f", ".g", "http://a/b/c/.g")
+check_absolute_url("http://a/b/c/d;p?q#f", "g..", "http://a/b/c/g..")
+check_absolute_url("http://a/b/c/d;p?q#f", "..g", "http://a/b/c/..g")
+check_absolute_url("http://a/b/c/d;p?q#f", "./../g", "http://a/b/g")
+check_absolute_url("http://a/b/c/d;p?q#f", "./g/.", "http://a/b/c/g/")
+check_absolute_url("http://a/b/c/d;p?q#f", "g/./h", "http://a/b/c/g/h")
+check_absolute_url("http://a/b/c/d;p?q#f", "g/../h", "http://a/b/c/h")
+
+-- extra tests
+check_absolute_url("//a/b/c/d;p?q#f", "d/e/f", "//a/b/c/d/e/f")
+check_absolute_url("/a/b/c/d;p?q#f", "d/e/f", "/a/b/c/d/e/f")
+check_absolute_url("a/b/c/d", "d/e/f", "a/b/c/d/e/f")
+check_absolute_url("a/b/c/d/../", "d/e/f", "a/b/c/d/e/f")
+check_absolute_url("http://velox.telemar.com.br", "/dashboard/index.html",
+ "http://velox.telemar.com.br/dashboard/index.html")
+
+print("testing path parsing and composition")
+check_parse_path("/eu/tu/ele", { "eu", "tu", "ele"; is_absolute = 1 })
+check_parse_path("/eu/", { "eu"; is_absolute = 1, is_directory = 1 })
+check_parse_path("eu/tu/ele/nos/vos/eles/",
+ { "eu", "tu", "ele", "nos", "vos", "eles"; is_directory = 1})
+check_parse_path("/", { is_absolute = 1, is_directory = 1})
+check_parse_path("", { })
+check_parse_path("eu%01/%02tu/e%03l%04e/nos/vos%05/e%12les/",
+ { "eu\1", "\2tu", "e\3l\4e", "nos", "vos\5", "e\18les"; is_directory = 1})
+check_parse_path("eu/tu", { "eu", "tu" })
+
+print("testing path protection")
+check_protect({ "eu", "-_.!~*'():@&=+$,", "tu" }, "eu/-_.!~*'():@&=+$,/tu")
+check_protect({ "eu ", "~diego" }, "eu%20/~diego")
+check_protect({ "/eu>", "", "/ tm then
+ if err ~= "timeout" then fail("should have timed out")
+ else pass("proper timeout") end
+ elseif elapsed < tm then
+ if err then fail(err)
+ else pass("ok") end
+ else
+ if alldone then
+ if err then fail("unexpected error '%s'", err)
+ else pass("ok") end
+ else
+ if err ~= "timeout" then fail(err)
+ else pass("proper timeoutk") end
+ end
+ end
+ else
+ if err then fail(err)
+ else pass("ok") end
+ end
+ end
+end
+
+if not socket._DEBUG then
+ fail("Please define LUASOCKET_DEBUG and recompile LuaSocket")
+end
+
+io.stderr:write("----------------------------------------------\n",
+"LuaSocket Test Procedures\n",
+"----------------------------------------------\n")
+
+start = socket.gettime()
+
+function reconnect()
+ io.stderr:write("attempting data connection... ")
+ if data then data:close() end
+ remote [[
+ i = i or 1
+ if data then data:close() data = nil end
+ print("accepting")
+ data = server:accept()
+ i = i + 1
+ print("done " .. i)
+ ]]
+ data, err = uconnect(host, port)
+ if not data then fail(err)
+ else pass("connected!") end
+end
+
+pass("attempting control connection...")
+control, err = uconnect(host, port)
+if err then fail(err)
+else pass("connected!") end
+
+------------------------------------------------------------------------
+function test_methods(sock, methods)
+ for _, v in pairs(methods) do
+ if type(sock[v]) ~= "function" then
+ fail(sock.class .. " method '" .. v .. "' not registered")
+ end
+ end
+ pass(sock.class .. " methods are ok")
+end
+
+------------------------------------------------------------------------
+function test_mixed(len)
+ reconnect()
+ local inter = math.ceil(len/4)
+ local p1 = "unix " .. string.rep("x", inter) .. "line\n"
+ local p2 = "dos " .. string.rep("y", inter) .. "line\r\n"
+ local p3 = "raw " .. string.rep("z", inter) .. "bytes"
+ local p4 = "end" .. string.rep("w", inter) .. "bytes"
+ local bp1, bp2, bp3, bp4
+remote (string.format("str = data:receive(%d)",
+ string.len(p1)+string.len(p2)+string.len(p3)+string.len(p4)))
+ sent, err = data:send(p1..p2..p3..p4)
+ if err then fail(err) end
+remote "data:send(str); data:close()"
+ bp1, err = data:receive()
+ if err then fail(err) end
+ bp2, err = data:receive()
+ if err then fail(err) end
+ bp3, err = data:receive(string.len(p3))
+ if err then fail(err) end
+ bp4, err = data:receive("*a")
+ if err then fail(err) end
+ if bp1.."\n" == p1 and bp2.."\r\n" == p2 and bp3 == p3 and bp4 == p4 then
+ pass("patterns match")
+ else fail("patterns don't match") end
+end
+
+------------------------------------------------------------------------
+function test_asciiline(len)
+ reconnect()
+ local str, str10, back, err
+ str = string.rep("x", math.mod(len, 10))
+ str10 = string.rep("aZb.c#dAe?", math.floor(len/10))
+ str = str .. str10
+remote "str = data:receive()"
+ sent, err = data:send(str.."\n")
+ if err then fail(err) end
+remote "data:send(str ..'\\n')"
+ back, err = data:receive()
+ if err then fail(err) end
+ if back == str then pass("lines match")
+ else fail("lines don't match") end
+end
+
+------------------------------------------------------------------------
+function test_rawline(len)
+ reconnect()
+ local str, str10, back, err
+ str = string.rep(string.char(47), math.mod(len, 10))
+ str10 = string.rep(string.char(120,21,77,4,5,0,7,36,44,100),
+ math.floor(len/10))
+ str = str .. str10
+remote "str = data:receive()"
+ sent, err = data:send(str.."\n")
+ if err then fail(err) end
+remote "data:send(str..'\\n')"
+ back, err = data:receive()
+ if err then fail(err) end
+ if back == str then pass("lines match")
+ else fail("lines don't match") end
+end
+
+------------------------------------------------------------------------
+function test_raw(len)
+ reconnect()
+ local half = math.floor(len/2)
+ local s1, s2, back, err
+ s1 = string.rep("x", half)
+ s2 = string.rep("y", len-half)
+remote (string.format("str = data:receive(%d)", len))
+ sent, err = data:send(s1)
+ if err then fail(err) end
+ sent, err = data:send(s2)
+ if err then fail(err) end
+remote "data:send(str)"
+ back, err = data:receive(len)
+ if err then fail(err) end
+ if back == s1..s2 then pass("blocks match")
+ else fail("blocks don't match") end
+end
+
+------------------------------------------------------------------------
+function test_totaltimeoutreceive(len, tm, sl)
+ reconnect()
+ local str, err, partial
+ pass("%d bytes, %ds total timeout, %ds pause", len, tm, sl)
+ remote (string.format ([[
+ data:settimeout(%d)
+ str = string.rep('a', %d)
+ data:send(str)
+ print('server: sleeping for %ds')
+ socket.sleep(%d)
+ print('server: woke up')
+ data:send(str)
+ ]], 2*tm, len, sl, sl))
+ data:settimeout(tm, "total")
+local t = socket.gettime()
+ str, err, partial, elapsed = data:receive(2*len)
+ check_timeout(tm, sl, elapsed, err, "receive", "total",
+ string.len(str or partial) == 2*len)
+end
+
+------------------------------------------------------------------------
+function test_totaltimeoutsend(len, tm, sl)
+ reconnect()
+ local str, err, total
+ pass("%d bytes, %ds total timeout, %ds pause", len, tm, sl)
+ remote (string.format ([[
+ data:settimeout(%d)
+ str = data:receive(%d)
+ print('server: sleeping for %ds')
+ socket.sleep(%d)
+ print('server: woke up')
+ str = data:receive(%d)
+ ]], 2*tm, len, sl, sl, len))
+ data:settimeout(tm, "total")
+ str = string.rep("a", 2*len)
+ total, err, partial, elapsed = data:send(str)
+ check_timeout(tm, sl, elapsed, err, "send", "total",
+ total == 2*len)
+end
+
+------------------------------------------------------------------------
+function test_blockingtimeoutreceive(len, tm, sl)
+ reconnect()
+ local str, err, partial
+ pass("%d bytes, %ds blocking timeout, %ds pause", len, tm, sl)
+ remote (string.format ([[
+ data:settimeout(%d)
+ str = string.rep('a', %d)
+ data:send(str)
+ print('server: sleeping for %ds')
+ socket.sleep(%d)
+ print('server: woke up')
+ data:send(str)
+ ]], 2*tm, len, sl, sl))
+ data:settimeout(tm)
+ str, err, partial, elapsed = data:receive(2*len)
+ check_timeout(tm, sl, elapsed, err, "receive", "blocking",
+ string.len(str or partial) == 2*len)
+end
+
+------------------------------------------------------------------------
+function test_blockingtimeoutsend(len, tm, sl)
+ reconnect()
+ local str, err, total
+ pass("%d bytes, %ds blocking timeout, %ds pause", len, tm, sl)
+ remote (string.format ([[
+ data:settimeout(%d)
+ str = data:receive(%d)
+ print('server: sleeping for %ds')
+ socket.sleep(%d)
+ print('server: woke up')
+ str = data:receive(%d)
+ ]], 2*tm, len, sl, sl, len))
+ data:settimeout(tm)
+ str = string.rep("a", 2*len)
+ total, err, partial, elapsed = data:send(str)
+ check_timeout(tm, sl, elapsed, err, "send", "blocking",
+ total == 2*len)
+end
+
+------------------------------------------------------------------------
+function empty_connect()
+ reconnect()
+ if data then data:close() data = nil end
+ remote [[
+ if data then data:close() data = nil end
+ data = server:accept()
+ ]]
+ data, err = socket.connect("", port)
+ if not data then
+ pass("ok")
+ data = socket.connect(host, port)
+ else
+ pass("gethostbyname returns localhost on empty string...")
+ end
+end
+
+------------------------------------------------------------------------
+function isclosed(c)
+ return c:getfd() == -1 or c:getfd() == (2^32-1)
+end
+
+function active_close()
+ reconnect()
+ if isclosed(data) then fail("should not be closed") end
+ data:close()
+ if not isclosed(data) then fail("should be closed") end
+ data = nil
+ local udp = socket.udp()
+ if isclosed(udp) then fail("should not be closed") end
+ udp:close()
+ if not isclosed(udp) then fail("should be closed") end
+ pass("ok")
+end
+
+------------------------------------------------------------------------
+function test_closed()
+ local back, partial, err
+ local str = 'little string'
+ reconnect()
+ pass("trying read detection")
+ remote (string.format ([[
+ data:send('%s')
+ data:close()
+ data = nil
+ ]], str))
+ -- try to get a line
+ back, err, partial = data:receive()
+ if not err then fail("should have gotten 'closed'.")
+ elseif err ~= "closed" then fail("got '"..err.."' instead of 'closed'.")
+ elseif str ~= partial then fail("didn't receive partial result.")
+ else pass("graceful 'closed' received") end
+ reconnect()
+ pass("trying write detection")
+ remote [[
+ data:close()
+ data = nil
+ ]]
+ total, err, partial = data:send(string.rep("ugauga", 100000))
+ if not err then
+ pass("failed: output buffer is at least %d bytes long!", total)
+ elseif err ~= "closed" then
+ fail("got '"..err.."' instead of 'closed'.")
+ else
+ pass("graceful 'closed' received after %d bytes were sent", partial)
+ end
+end
+
+------------------------------------------------------------------------
+function test_selectbugs()
+ local r, s, e = socket.select(nil, nil, 0.1)
+ assert(type(r) == "table" and type(s) == "table" and
+ (e == "timeout" or e == "error"))
+ pass("both nil: ok")
+ local udp = socket.udp()
+ udp:close()
+ r, s, e = socket.select({ udp }, { udp }, 0.1)
+ assert(type(r) == "table" and type(s) == "table" and
+ (e == "timeout" or e == "error"))
+ pass("closed sockets: ok")
+ e = pcall(socket.select, "wrong", 1, 0.1)
+ assert(e == false)
+ e = pcall(socket.select, {}, 1, 0.1)
+ assert(e == false)
+ pass("invalid input: ok")
+end
+
+------------------------------------------------------------------------
+function accept_timeout()
+ io.stderr:write("accept with timeout (if it hangs, it failed): ")
+ local s, e = socket.bind("*", 0, 0)
+ assert(s, e)
+ local t = socket.gettime()
+ s:settimeout(1)
+ local c, e = s:accept()
+ assert(not c, "should not accept")
+ assert(e == "timeout", string.format("wrong error message (%s)", e))
+ t = socket.gettime() - t
+ assert(t < 2, string.format("took to long to give up (%gs)", t))
+ s:close()
+ pass("good")
+end
+
+------------------------------------------------------------------------
+function connect_timeout()
+ io.stderr:write("connect with timeout (if it hangs, it failed!): ")
+ local t = socket.gettime()
+ local c, e = socket.tcp()
+ assert(c, e)
+ c:settimeout(0.1)
+ local t = socket.gettime()
+ local r, e = c:connect("127.0.0.2", 80)
+ assert(not r, "should not connect")
+ assert(socket.gettime() - t < 2, "took too long to give up.")
+ c:close()
+ print("ok")
+end
+
+------------------------------------------------------------------------
+function accept_errors()
+ io.stderr:write("not listening: ")
+ local d, e = socket.bind("*", 0)
+ assert(d, e);
+ local c, e = socket.tcp();
+ assert(c, e);
+ d:setfd(c:getfd())
+ d:settimeout(2)
+ local r, e = d:accept()
+ assert(not r and e)
+ print("ok: ", e)
+ io.stderr:write("not supported: ")
+ local c, e = socket.udp()
+ assert(c, e);
+ d:setfd(c:getfd())
+ local r, e = d:accept()
+ assert(not r and e)
+ print("ok: ", e)
+end
+
+------------------------------------------------------------------------
+function connect_errors()
+ io.stderr:write("connection refused: ")
+ local c, e = socket.connect("localhost", 1);
+ assert(not c and e)
+ print("ok: ", e)
+ io.stderr:write("host not found: ")
+ local c, e = socket.connect("host.is.invalid", 1);
+ assert(not c and e, e)
+ print("ok: ", e)
+end
+
+------------------------------------------------------------------------
+function rebind_test()
+ local c = socket.bind("localhost", 0)
+ local i, p = c:getsockname()
+ local s, e = socket.tcp()
+ assert(s, e)
+ s:setoption("reuseaddr", false)
+ r, e = s:bind("localhost", p)
+ assert(not r, "managed to rebind!")
+ assert(e)
+ print("ok: ", e)
+end
+
+------------------------------------------------------------------------
+function getstats_test()
+ reconnect()
+ local t = 0
+ for i = 1, 25 do
+ local c = math.random(1, 100)
+ remote (string.format ([[
+ str = data:receive(%d)
+ data:send(str)
+ ]], c))
+ data:send(string.rep("a", c))
+ data:receive(c)
+ t = t + c
+ local r, s, a = data:getstats()
+ assert(r == t, "received count failed" .. tostring(r)
+ .. "/" .. tostring(t))
+ assert(s == t, "sent count failed" .. tostring(s)
+ .. "/" .. tostring(t))
+ end
+ print("ok")
+end
+
+
+------------------------------------------------------------------------
+function test_nonblocking(size)
+ reconnect()
+print("Testing " .. 2*size .. " bytes")
+remote(string.format([[
+ data:send(string.rep("a", %d))
+ socket.sleep(0.5)
+ data:send(string.rep("b", %d) .. "\n")
+]], size, size))
+ local err = "timeout"
+ local part = ""
+ local str
+ data:settimeout(0)
+ while 1 do
+ str, err, part = data:receive("*l", part)
+ if err ~= "timeout" then break end
+ end
+ assert(str == (string.rep("a", size) .. string.rep("b", size)))
+ reconnect()
+remote(string.format([[
+ str = data:receive(%d)
+ socket.sleep(0.5)
+ str = data:receive(%d, str)
+ data:send(str)
+]], size, size))
+ data:settimeout(0)
+ local start = 0
+ while 1 do
+ ret, err, start = data:send(str, start+1)
+ if err ~= "timeout" then break end
+ end
+ data:send("\n")
+ data:settimeout(-1)
+ local back = data:receive(2*size)
+ assert(back == str, "'" .. back .. "' vs '" .. str .. "'")
+ print("ok")
+end
+
+------------------------------------------------------------------------
+
+test("method registration")
+test_methods(socket.unix(), {
+ "accept",
+ "bind",
+ "close",
+ "connect",
+ "dirty",
+ "getfd",
+ "getstats",
+ "setstats",
+ "listen",
+ "receive",
+ "send",
+ "setfd",
+ "setoption",
+ "setpeername",
+ "setsockname",
+ "settimeout",
+ "shutdown",
+})
+
+test("connect function")
+--connect_timeout()
+--empty_connect()
+--connect_errors()
+
+--test("rebinding: ")
+--rebind_test()
+
+test("active close: ")
+active_close()
+
+test("closed connection detection: ")
+test_closed()
+
+test("accept function: ")
+accept_timeout()
+accept_errors()
+
+test("getstats test")
+getstats_test()
+
+test("character line")
+test_asciiline(1)
+test_asciiline(17)
+test_asciiline(200)
+test_asciiline(4091)
+test_asciiline(80199)
+test_asciiline(8000000)
+test_asciiline(80199)
+test_asciiline(4091)
+test_asciiline(200)
+test_asciiline(17)
+test_asciiline(1)
+
+test("mixed patterns")
+test_mixed(1)
+test_mixed(17)
+test_mixed(200)
+test_mixed(4091)
+test_mixed(801990)
+test_mixed(4091)
+test_mixed(200)
+test_mixed(17)
+test_mixed(1)
+
+test("binary line")
+test_rawline(1)
+test_rawline(17)
+test_rawline(200)
+test_rawline(4091)
+test_rawline(80199)
+test_rawline(8000000)
+test_rawline(80199)
+test_rawline(4091)
+test_rawline(200)
+test_rawline(17)
+test_rawline(1)
+
+test("raw transfer")
+test_raw(1)
+test_raw(17)
+test_raw(200)
+test_raw(4091)
+test_raw(80199)
+test_raw(8000000)
+test_raw(80199)
+test_raw(4091)
+test_raw(200)
+test_raw(17)
+test_raw(1)
+
+test("non-blocking transfer")
+test_nonblocking(1)
+test_nonblocking(17)
+test_nonblocking(200)
+test_nonblocking(4091)
+test_nonblocking(80199)
+test_nonblocking(8000000)
+test_nonblocking(80199)
+test_nonblocking(4091)
+test_nonblocking(200)
+test_nonblocking(17)
+test_nonblocking(1)
+
+test("total timeout on send")
+test_totaltimeoutsend(800091, 1, 3)
+test_totaltimeoutsend(800091, 2, 3)
+test_totaltimeoutsend(800091, 5, 2)
+test_totaltimeoutsend(800091, 3, 1)
+
+test("total timeout on receive")
+test_totaltimeoutreceive(800091, 1, 3)
+test_totaltimeoutreceive(800091, 2, 3)
+test_totaltimeoutreceive(800091, 3, 2)
+test_totaltimeoutreceive(800091, 3, 1)
+
+test("blocking timeout on send")
+test_blockingtimeoutsend(800091, 1, 3)
+test_blockingtimeoutsend(800091, 2, 3)
+test_blockingtimeoutsend(800091, 3, 2)
+test_blockingtimeoutsend(800091, 3, 1)
+
+test("blocking timeout on receive")
+test_blockingtimeoutreceive(800091, 1, 3)
+test_blockingtimeoutreceive(800091, 2, 3)
+test_blockingtimeoutreceive(800091, 3, 2)
+test_blockingtimeoutreceive(800091, 3, 1)
+
+test(string.format("done in %.2fs", socket.gettime() - start))
diff --git a/test/utestsrvr.lua b/test/utestsrvr.lua
new file mode 100644
index 0000000..a96b570
--- /dev/null
+++ b/test/utestsrvr.lua
@@ -0,0 +1,17 @@
+socket=require("socket");
+os.remove("/tmp/luasocket")
+socket.unix = require("socket.unix");
+host = host or "luasocket";
+server = assert(socket.unix())
+assert(server:bind(host))
+assert(server:listen(5))
+ack = "\n";
+while 1 do
+ print("server: waiting for client connection...");
+ control = assert(server:accept());
+ while 1 do
+ command = assert(control:receive());
+ assert(control:send(ack));
+ ((loadstring or load)(command))();
+ end
+end
diff --git a/win32.cmd b/win32.cmd
new file mode 100644
index 0000000..48522f0
--- /dev/null
+++ b/win32.cmd
@@ -0,0 +1,12 @@
+make PLAT=win32 LUAV=5.2 LUAINC_win32='c:\cygwin\home\diego\build\include' LUALIB_win32='c:\cygwin\home\diego\build\bin\release'
+
+#!/bin/sh
+for p in Release Debug x64/Release x64/Debug; do
+ for el in mime socket; do
+ for e in dll lib; do
+ cp $p/$el/core.$e ../bin/$p/$el/
+ done;
+ done;
+ cp src/ltn12.lua src/socket.lua src/mime.lua ../bin/$p/
+ cp src/http.lua src/url.lua src/tp.lua src/ftp.lua src/headers.lua src/smtp.lua ../bin/$p/socket/
+done;
+