Allow to compress on-the-wire data using two algorithms:

- HOLE - it simply turns all-zero blocks into few bytes header;
	it is extremely fast, so it is turned on by default;
	it is mostly intended to speed up initial synchronization
	where we expect many zeros;
- LZF - very fast algorithm by Marc Alexander Lehmann, which shows
	very decent compression ratio and has BSD license.

MFC after:	2 weeks

1 files changed, 3 insertions, 0 deletions

diff --git a/sbin/hastd/token.l b/sbin/hastd/token.l
index c42c130..1992b77 100644
--- a/sbin/hastd/token.l
+++ b/sbin/hastd/token.l
@@ -50,6 +50,7 @@ listen			{ DP; return LISTEN; }
 port			{ DP; return PORT; }
 replication		{ DP; return REPLICATION; }
 checksum		{ DP; return CHECKSUM; }
+compression		{ DP; return COMPRESSION; }
 timeout			{ DP; return TIMEOUT; }
 exec			{ DP; return EXEC; }
 resource		{ DP; return RESOURCE; }
@@ -63,6 +64,8 @@ async			{ DP; return ASYNC; }
 none			{ DP; return NONE; }
 crc32			{ DP; return CRC32; }
 sha256			{ DP; return SHA256; }
+hole			{ DP; return HOLE; }
+lzf			{ DP; return LZF; }
 [0-9]+			{ DP; yylval.num = atoi(yytext); return NUM; }
 [a-zA-Z0-9\.\-_/\:]+	{ DP; yylval.str = strdup(yytext); return STR; }
 \{			{ DP; depth++; return OB; }