99 lines
2.5 KiB
D
99 lines
2.5 KiB
D
import vibe.core.core;
|
|
import vibe.core.log;
|
|
import vibe.core.net;
|
|
import vibe.core.stream;
|
|
|
|
import std.exception : enforce;
|
|
import std.functional : toDelegate;
|
|
import std.range.primitives : isOutputRange;
|
|
|
|
|
|
void main()
|
|
{
|
|
void staticAnswer(TCPConnection conn)
|
|
nothrow @safe {
|
|
try {
|
|
while (!conn.empty) {
|
|
while (true) {
|
|
CountingRange r;
|
|
conn.readLine(r);
|
|
if (!r.count) break;
|
|
}
|
|
conn.write(cast(const(ubyte)[])"HTTP/1.1 200 OK\r\nContent-Length: 13\r\nContent-Type: text/plain\r\nConnection: keep-alive\r\n\r\nHello, World!");
|
|
conn.flush();
|
|
}
|
|
} catch (Exception e) {
|
|
scope (failure) assert(false);
|
|
logError("Error processing request: %s", e.msg);
|
|
}
|
|
}
|
|
|
|
auto listener = listenTCP(8080, &staticAnswer, "127.0.0.1");
|
|
logInfo("Listening to HTTP requests on http://127.0.0.1:8080/");
|
|
|
|
runApplication();
|
|
}
|
|
|
|
struct CountingRange {
|
|
@safe nothrow @nogc:
|
|
ulong count = 0;
|
|
void put(ubyte) { count++; }
|
|
void put(in ubyte[] arr) { count += arr.length; }
|
|
}
|
|
|
|
void readLine(R, InputStream)(InputStream stream, ref R dst, size_t max_bytes = size_t.max)
|
|
if (isInputStream!InputStream && isOutputRange!(R, ubyte))
|
|
{
|
|
import std.algorithm.comparison : min, max;
|
|
import std.algorithm.searching : countUntil;
|
|
|
|
enum end_marker = "\r\n";
|
|
enum nmarker = end_marker.length;
|
|
|
|
size_t nmatched = 0;
|
|
|
|
while (true) {
|
|
enforce(!stream.empty, "Reached EOF while searching for end marker.");
|
|
enforce(max_bytes > 0, "Reached maximum number of bytes while searching for end marker.");
|
|
auto max_peek = max(max_bytes, max_bytes+nmarker); // account for integer overflow
|
|
auto pm = stream.peek()[0 .. min($, max_bytes)];
|
|
if (!pm.length) { // no peek support - inefficient route
|
|
ubyte[2] buf = void;
|
|
auto l = nmarker - nmatched;
|
|
stream.read(buf[0 .. l]);
|
|
foreach (i; 0 .. l) {
|
|
if (buf[i] == end_marker[nmatched]) {
|
|
nmatched++;
|
|
} else if (buf[i] == end_marker[0]) {
|
|
foreach (j; 0 .. nmatched) dst.put(end_marker[j]);
|
|
nmatched = 1;
|
|
} else {
|
|
foreach (j; 0 .. nmatched) dst.put(end_marker[j]);
|
|
nmatched = 0;
|
|
dst.put(buf[i]);
|
|
}
|
|
if (nmatched == nmarker) return;
|
|
}
|
|
} else {
|
|
assert(nmatched == 0);
|
|
|
|
auto idx = pm.countUntil(end_marker[0]);
|
|
if (idx < 0) {
|
|
dst.put(pm);
|
|
max_bytes -= pm.length;
|
|
stream.skip(pm.length);
|
|
} else {
|
|
dst.put(pm[0 .. idx]);
|
|
if (idx+1 < pm.length && pm[idx+1] == end_marker[1]) {
|
|
assert(nmarker == 2);
|
|
stream.skip(idx+2);
|
|
return;
|
|
} else {
|
|
nmatched++;
|
|
stream.skip(idx+1);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|