initial markdown works

26 files changed, 2029 insertions, 0 deletions

diff --git a/content/md/contact-information.md b/content/md/contact-information.md
new file mode 100644
index 00000000..935f698e
--- /dev/null
+++ b/content/md/contact-information.md
@@ -0,0 +1,38 @@
+[Go back to the main site](./)
+
+# Contact information
+
+## E-Mail
+
+* Secure E-Mail: paul.buetow at protonmail dot com
+* E-Mail: paul at buetow dot org (forwards to the ProtonMail address)
+
+Why did I just mention 2 E-Mail addresses here? The buetow.org address will always stay. It is my lifetime E-Mail address as I own the domain name. The address will stay even when I decided to change my email provider.
+
+Use the ProtonMail address if you care about security for now. The address stays valid as long as I am ProtonMail user. Especially if you are ProtonMail user too we could have real E-Mail end-2-end encryption for our conversation.
+
+## Quick Links
+
+### Social Media
+
+I am sharing articles which I found interesting regularly on all the social media channels. To get you navigated quickly, here are the links:
+
+[My LinkedIn profile](https://www.linkedin.com/in/paul-buetow-b4857270/)
+[My Twitter profile](https://twitter.com/snonux)
+[My Telegram channel](https://t.me/snonux)
+
+### My Open Source code repositories
+
+[My personal GitHub page](https://github.com/snonux)
+[DTail at Mimecast](https://github.com/mimecast/dtail)
+[I/O Riot at Mimecast](https://github.com/mimecast/ioriot)
+
+### My old personal website
+
+It's still there for fun + profit.
+
+[http://paul.buetow.org](http://paul.buetow.org)
+
+It's powered by Xerl, my own CMS:
+
+[http://xerl.buetow.org](http://xerl.buetow.org)
diff --git a/content/md/favicon.ico b/content/md/favicon.ico
new file mode 100644
index 00000000..999c023e
--- /dev/null
+++ b/content/md/favicon.ico
diff --git a/content/md/gemfeed/2008-06-26-perl-poetry.md b/content/md/gemfeed/2008-06-26-perl-poetry.md
new file mode 100644
index 00000000..d53faef3
--- /dev/null
+++ b/content/md/gemfeed/2008-06-26-perl-poetry.md
@@ -0,0 +1,166 @@
+> Written by Paul Buetow 2008-06-26, last updated 2021-05-04
+
+[Go back to the main site](../)
+
+# Perl Poetry
+
+```
+ '\|/'                                  *
+-- * -----
+  /|\      ____
+ ' | '    {_   o^>       *
+   :        -_  /)
+   :         (   (        .-''`'.
+   .          \   \      /       \
+   .           \    \   /         \
+                \    `-'           `'.
+                 \    . '        /    `.
+                  \  ( \  )     (     .')
+   ,,   t          '. |  /       |     (
+  '|``_/^\___        '|  |`'-..-'|   ( ()
+_~~|~/_|_|__/|~~~~~~~ |  / ~~~~~ |   | ~~~~~~~~
+ -_  |L[|]L|/         | |\ MJP   )   )
+                      ( |(       /  /|
+   ~~ ~  ~ ~~~~       | /\\     / /| |
+                      ||  \\  _/ / | |
+             ~ ~ ~~~ _|| (_/ (___)_| |Nov291999
+                    (__)         (____)
+```
+
+Here are some Perl Poems I wrote. They don't do anything useful when you run them, but they don't produce a compiler error either. They only exist for fun and demonstrate what you can do with Perl syntax.
+
+Wikipedia: "Perl poetry is the practice of writing poems that can be compiled as legal Perl code, for example the piece known as Black Perl. Perl poetry is made possible by the large number of English words that are used in the Perl language. New poems are regularly submitted to the community at PerlMonks."
+
+[https://en.wikipedia.org/wiki/Perl](https://en.wikipedia.org/wiki/Perl)
+
+## math.pl
+
+```
+#!/usr/bin/perl
+
+# (C) 2006 by Paul C. Buetow (http://paul.buetow.org) 
+
+goto library for study $math;
+BEGIN { s/earching/ books/ 
+and read $them, $at, $the } library:
+
+our $topics, cos and tan, 
+require strict; import { of, tied $patience };
+
+do { int'egrate'; sub trade; };
+do { exp'onentize' and abs'olutize' };
+study and study and study and study;
+
+foreach $topic ({of, math}) {
+you, m/ay /go, to, limits }
+
+do { not qw/erk / unless $success 
+and m/ove /o;$n and study };
+
+do { int'egrate'; sub trade; };
+do { exp'onentize' and abs'olutize' };
+study and study and study and study;
+
+grep /all/, exp'onents' and cos'inuses';
+/seek results/ for @all, log'4rithms';
+
+'you' =~ m/ay /go, not home 
+unless each %book ne#ars
+$completion;
+
+do { int'egrate'; sub trade; };
+do { exp'onentize' and abs'olutize' };
+
+#at
+home: //ig,'nore', time and sleep $very =~ s/tr/on/g;
+__END__
+
+```
+
+## christmas.pl
+
+```
+#!/usr/bin/perl
+
+# (C) 2006 by Paul C. Buetow (http://paul.buetow.org) 
+
+Christmas:{time;#!!!
+
+Children: do tell $wishes;
+
+Santa: for $each (@children) { 
+BEGIN { read $each, $their, wishes and study them; use Memoize#ing
+
+} use constant gift, 'wrapping'; 
+package Gifts; pack $each, gift and bless $each and goto deliver
+or do import if not local $available,!!! HO, HO, HO;
+
+redo Santa, pipe $gifts, to_childs;
+redo Santa and do return if last one, is, delivered; 
+
+deliver: gift and require diagnostics if our $gifts ,not break;
+do{ use NEXT; time; tied $gifts} if broken and dump the, broken, ones;
+The_children: sleep and wait for (each %gift) and try { to => untie $gifts };
+
+redo Santa, pipe $gifts, to_childs;
+redo Santa and do return if last one, is, delivered; 
+
+The_christmas_tree: formline s/ /childrens/, $gifts;
+alarm and warn if not exists $Christmas{ tree}, @t, $ENV{HOME};  
+write <<EMail
+ to the parents to buy a new christmas tree!!!!111
+ and send the
+EMail
+;wait and redo deliver until defined local $tree;
+
+redo Santa, pipe $gifts, to_childs;
+redo Santa and do return if last one, is, delivered ;}
+
+END {} our $mission and do sleep until next Christmas ;}
+
+__END__
+
+This is perl, v5.8.8 built for i386-freebsd-64int
+```
+
+## shopping.pl
+
+```
+#!/usr/bin/perl
+
+# (C) 2007 by Paul C. Buetow (http://paul.buetow.org) 
+
+BEGIN{} goto mall for $shopping; 
+
+m/y/; mall: seek$s, cool products(), { to => $sell };
+for $their (@business) { to:; earn:; a:; lot:; of:; money: }
+
+do not goto home and exit mall if exists $new{product};
+foreach $of (q(uality rich products)){} package products; 
+
+our $news; do tell cool products() and do{ sub#tract
+cool{ $products and shift @the, @bad, @ones;
+
+do bless [q(uality)], $products 
+and return not undef $stuff if not (local $available) }};
+
+do { study and study and study for cool products() }
+and do { seek $all, cool products(), { to => $buy } };
+
+do { write $them, $down } and do { order: foreach (@case) { package s } };
+goto home if not exists $more{money} or die q(uerying) ;for( @money){};
+
+at:;home: do { END{} and:; rest:; a:; bit: exit $shopping } 
+and sleep until unpack$ing, cool products();
+
+__END__
+This is perl, v5.8.8 built for i386-freebsd-64int
+```
+
+## More...
+
+Did you like what you saw? Have a look at Github to see my other poems too:
+
+[https://github.com/snonux/perl-poetry](https://github.com/snonux/perl-poetry)
+
+E-Mail me your thoughts at comments@mx.buetow.org!
diff --git a/content/md/gemfeed/2010-05-09-the-fype-programming-language.md b/content/md/gemfeed/2010-05-09-the-fype-programming-language.md
new file mode 100644
index 00000000..6a0be90d
--- /dev/null
+++ b/content/md/gemfeed/2010-05-09-the-fype-programming-language.md
@@ -0,0 +1,511 @@
+> Written by Paul Buetow 2010-05-09, last updated 2021-05-05
+
+[Go back to the main site](../)
+
+```
+      ____                                      _        __       
+     / / _|_   _ _ __   ___    _   _  ___  __ _| |__    / _|_   _ 
+    / / |_| | | | '_ \ / _ \  | | | |/ _ \/ _` | '_ \  | |_| | | |
+ _ / /|  _| |_| | |_) |  __/  | |_| |  __/ (_| | | | |_|  _| |_| |
+(_)_/ |_|  \__, | .__/ \___|   \__, |\___|\__,_|_| |_(_)_|  \__, |
+           |___/|_|            |___/                        |___/ 
+
+```
+
+# The Fype Programming Language
+
+Fype is an interpreted programming language created by me for learning and fun. The interpreter is written in C. It has been tested on FreeBSD and NetBSD and may also work on other Unix like operating systems such as Linux based ones. To be honest, besides learning and fun there is really no other use case of why Fype actually exists as many other programming languages are much faster and more powerful.
+
+The Fype syntax is very simple and is using a maximum look ahead of 1 and a very easy top down parsing mechanism. Fype is parsing and interpreting its code simultaneously. This means, that syntax errors are only detected during program runtime. 
+
+Fype is a recursive acronym and means "Fype is For Your Program Execution" or "Fype is Free Yak Programmed for ELF". You could also say "It's not a hype - it's Fype!".
+
+## Object oriented C style
+
+The Fype interpreter is written in an object oriented style of C. Each "main component" has its own .h and .c file. There is a struct type for each (most components at least) component which can be initialized using a "COMPONENT_new" function and destroyed using a "COMPONENT_delete" function. Method calls follow the same schema, e.g. "COMPONENT_METHODNAME". There is no such as class inheritance and polymorphism involved. 
+
+To give you an idea how it works here as an example is a snippet from the main Fype "class header":
+
+```
+typedef struct {
+   Tupel *p_tupel_argv; // Contains command line options
+   List *p_list_token; // Initial list of token
+   Hash *p_hash_syms; // Symbol table
+   char *c_basename;
+} Fype;
+```
+
+And here is a snippet from the main Fype "class implementation":
+
+```
+Fype*
+fype_new() {
+   Fype *p_fype = malloc(sizeof(Fype));
+
+   p_fype->p_hash_syms = hash_new(512);
+   p_fype->p_list_token = list_new();
+   p_fype->p_tupel_argv = tupel_new();
+   p_fype->c_basename = NULL;
+
+   garbage_init();
+
+   return (p_fype);
+}
+
+void
+fype_delete(Fype *p_fype) {
+   argv_tupel_delete(p_fype->p_tupel_argv);
+
+   hash_iterate(p_fype->p_hash_syms, symbol_cleanup_hash_syms_cb);
+   hash_delete(p_fype->p_hash_syms);
+
+   list_iterate(p_fype->p_list_token, token_ref_down_cb);
+   list_delete(p_fype->p_list_token);
+
+   if (p_fype->c_basename)
+      free(p_fype->c_basename);
+
+   garbage_destroy();
+}
+
+int
+fype_run(int i_argc, char **pc_argv) {
+   Fype *p_fype = fype_new();
+
+   // argv: Maintains command line options
+   argv_run(p_fype, i_argc, pc_argv);
+
+   // scanner: Creates a list of token
+   scanner_run(p_fype);
+
+   // interpret: Interpret the list of token
+   interpret_run(p_fype);
+
+   fype_delete(p_fype);
+
+   return (0);
+}
+```
+
+## Data types
+
+Fype uses auto type conversion. However, if you want to know what's going on you may take a look at the following basic data types:
+* integer - Specifies a number
+* double - Specifies a double precision number
+* string - Specifies a string
+* number - May be an integer or a double number
+* any- May be any type above
+* void - No type
+* identifier - It's a variable name or a procedure name or a function name
+
+There is no boolean type, but we can use the integer values 0 for false and 1 for true. There is support for explicit type casting too.
+
+## Syntax
+
+### Comments
+
+Text from a # character until the end of the current line is considered being a comment. Multi line comments may start with an #* and with a *# anywhere. Exceptions are if those signs are inside of strings.
+
+### Variables
+
+Variables can be defined with the "my" keyword (inspired by Perl :-). If you don't assign a value during declaration, then it's using the default integer value 0. Variables may be changed during program runtime. Variables may be deleted using the "undef" keyword! Example:
+
+```
+my foo = 1 + 2;
+say foo; 
+
+my bar = 12, baz = foo;
+say 1 + bar;
+say bar;
+
+my baz;
+say baz; # Will print out 0
+```
+
+You may use the "defined" keyword to check if an identifier has been defined or not:
+
+```
+ifnot defined foo {
+	say "No foo yet defined";
+}
+
+my foo = 1;
+
+if defined foo {
+	put "foo is defined and has the value ";
+	say foo;
+}
+```
+
+### Synonyms
+
+Each variable can have as many synonyms as wished. A synonym is another name to access the content of a specific variable. Here is an example of how to use is:
+
+```
+my foo = "foo";
+my bar = \foo;
+foo = "bar";
+
+# The synonym variable should now also set to "bar"
+assert "bar" == bar;
+```
+
+Synonyms can be used for all kind of identifiers. It's not limited to normal variables but can be also used for function and procedure names etc (more about functions and procedures later).
+
+```
+# Create a new procedure baz
+proc baz { say "I am baz"; }
+
+# Make a synonym baz, and undefine baz
+my bay = \baz;
+
+undef baz;
+
+# bay still has a reference of the original procedure baz
+bay; # this prints aut "I am baz" 
+```
+
+The "syms" keyword gives you the total number of synonyms pointing to a specific value:
+
+```
+my foo = 1;
+say syms foo; # Prints 1
+
+my baz = \foo; 
+say syms foo; # Prints 2
+say syms baz; # Prints 2
+
+undef baz;
+say syms foo; # Prints 1
+```
+
+## Statements and expressions
+
+A Fype program is a list of statements. Each keyword, expression or function call is part of a statement. Each statement is ended with a semicolon. Example:
+
+```
+my bar = 3, foo = 1 + 2; 
+say foo;
+exit foo - bar;
+```
+
+### Parenthesis
+
+All parenthesis for function arguments are optional. They help to make the code better readable. They also help to force precedence of expressions.
+
+### Basic expressions
+
+Any "any" value holding a string will be automatically converted to an integer value.
+
+```
+(any) <any> + <any>
+(any) <any> - <any>
+(any) <any> * <any>
+(any) <any> / <any>
+(integer) <any> == <any>
+(integer) <any> != <any>
+(integer) <any> <= <any>
+(integer) <any> gt <any>
+(integer) <any> <> <any>
+(integer) <any> gt <any>
+(integer) not <any>
+```
+
+### Bitwise expressions
+
+```
+(integer) <any> :< <any>
+(integer) <any> :> <any>
+(integer) <any> and <any>
+(integer) <any> or <any>
+(integer) <any> xor <any>
+```
+
+### Numeric expressions
+
+```
+(number) neg <number>
+```
+
+... returns the negative value of "number":
+
+```
+(integer) no <integer>
+```
+
+... returns 1 if the argument is 0, otherwise it will return 0! If no argument is given, then 0 is returned!
+
+```
+(integer) yes <integer>
+```
+
+... always returns 1. The parameter is optional. Example:
+
+```
+# Prints out 1, because foo is not defined
+if yes { say no defined foo; } 
+```
+
+## Control statements
+
+Control statements available in Fype:
+
+```
+if <expression> { <statements> }
+```
+
+... runs the statements if the expression evaluates to a true value.
+
+```
+ifnot <expression> { <statements> }
+```
+
+... runs the statements if the expression evaluates to a false value.
+
+```
+while <expression> { <statements> }
+```
+
+... runs the statements as long as the expression evaluates to a true value.
+
+```
+until <expression> { <statements> }
+```
+
+... runs the statements as long as the expression evaluates to a false value.
+
+## Scopes
+
+A new scope starts with an { and ends with an }. An exception is a procedure, which does not use its own scope (see later in this manual). Control statements and functions support scopes.  The "scope"  function prints out all available symbols at the current scope. Here is a small example:
+
+```
+my foo = 1;
+
+{
+	# Prints out 1
+	put defined foo;
+	{
+		my bar = 2;
+
+		# Prints out 1
+		put defined bar;
+
+		# Prints out all available symbols at this
+		# point to stdout. Those are: bar and foo
+		scope;
+	}
+
+	# Prints out 0
+	put defined bar;
+
+	my baz = 3;
+}
+
+# Prints out 0
+say defined bar;
+```
+
+Another example including an actual output:
+
+```
+./fype -e ’my global; func foo { my var4; func bar { my var2, var3; func baz { my var1; scope; } baz; } bar; } foo;’
+Scopes:
+Scope stack size: 3
+Global symbols:
+SYM_VARIABLE: global (id=00034, line=-0001, pos=-001, type=TT_INTEGER, dval=0.000000, refs=-1)
+SYM_FUNCTION: foo
+Local symbols:
+SYM_VARIABLE: var1 (id=00038, line=-0001, pos=-001, type=TT_INTEGER, dval=0.000000, refs=-1)
+1 level(s) up:
+SYM_VARIABLE: var2 (id=00036, line=-0001, pos=-001, type=TT_INTEGER, dval=0.000000, refs=-1)
+SYM_VARIABLE: var3 (id=00037, line=-0001, pos=-001, type=TT_INTEGER, dval=0.000000, refs=-1)
+SYM_FUNCTION: baz
+2 level(s) up:
+SYM_VARIABLE: var4 (id=00035, line=-0001, pos=-001, type=TT_INTEGER, dval=0.000000, refs=-1)
+SYM_FUNCTION: bar
+```
+
+## Definedness 
+
+```
+(integer) defined <identifier>
+```
+
+... returns 1 if "identifier" has been defined. Returns 0 otherwise.
+
+```
+(integer) undef <identifier>
+```
+
+... tries to undefine/delete the "identifier". Returns 1 if it succeeded, otherwise 0 is returned.
+
+## System 
+
+These are some system and interpreter specific built-in functions supported:
+
+```
+(void) end
+```
+
+... exits the program with the exit status of 0.
+
+```
+(void) exit <integer>
+```
+
+... exits the program with the specified exit status.
+
+```
+(integer) fork
+```
+
+... forks a subprocess. It returns 0 for the child process and the pid of the child process otherwise! Example:
+
+```
+my pid = fork;
+
+if pid {
+	put "I am the parent process; child has the pid ";
+	say pid;
+
+} ifnot pid {
+	say "I am the child process";
+}
+```
+
+To execute the garbage collector do:
+
+```
+(integer) gc
+```
+
+It returns the number of items freed! You may wonder why most of the time it will return a value of 0! Fype tries to free not needed memory ASAP. This may change in future versions in order to gain faster execution speed!
+
+### I/O 
+
+```
+(any) put <any>
+```
+
+... prints out the argument
+
+```
+(any) say <any>
+```
+
+is the same as put, but also includes an ending newline.
+
+```
+(void) ln
+```
+
+... just prints a newline.
+
+## Procedures and functions
+
+### Procedures
+
+A procedure can be defined with the "proc" keyword and deleted with the "undef" keyword. A procedure does not return any value and does not support parameter passing. It's using already defined variables (e.g. global variables). A procedure does not have its own namespace. It's using the calling namespace. It is possible to define new variables inside of a procedure in the current namespace.
+
+```
+proc foo {
+	say 1 + a * 3 + b;
+	my c = 6;
+}
+
+my a = 2, b = 4;
+
+foo; # Run the procedure. Print out "11\n"
+say c; # Print out "6\n";
+```
+
+### Nested procedures
+
+It's possible to define procedures inside of procedures. Since procedures don't have its own scope, nested procedures will be available to the current scope as soon as the main procedure has run the first time. You may use the "defined" keyword in order to check if a procedure has been defined or not.
+
+```
+proc foo {
+	say "I am foo";
+
+	undef bar;
+	proc bar {
+		say "I am bar";
+	}
+}
+
+# Here bar would produce an error because 
+# the proc is not yet defined!
+# bar; 
+
+foo; # Here the procedure foo will define the procedure bar!
+bar; # Now the procedure bar is defined!
+foo; # Here the procedure foo will redefine bar again!
+```
+
+### Functions
+
+A function can be defined with the "func" keyword and deleted with the "undef" keyword. Function do not yet return values and do not yet supports parameter passing. It's using local (lexical scoped) variables. If a certain variable does not exist, when It's using already defined variables (e.g. one scope above). 
+
+```
+func foo {
+	say 1 + a * 3 + b;
+	my c = 6;
+}
+
+my a = 2, b = 4;
+
+foo; # Run the procedure. Print out "11\n"
+say c; # Will produce an error, because c is out of scoped!
+```
+
+### Nested functions
+
+Nested functions work the same way the nested procedures work, with the exception that nested functions will not be available anymore after the function has been left!
+
+```
+func foo {
+	func bar {
+		say "Hello i am nested";
+	}
+
+	bar; # Calling nested
+}
+
+foo;
+bar; # Will produce an error, because bar is out of scope!
+```
+
+## Arrays
+
+Some progress on arrays has been made too. The following example creates a multi dimensional array "foo". Its first element is the return value of the func which is "bar". The fourth value is a string ”3” converted to a double number. The last element is an anonymous array which itself contains another anonymous array as its last element:
+
+```
+func bar { say ”bar” }
+my foo = [bar, 1, 4/2, double ”3”, [”A”, [”BA”, ”BB”]]];
+say foo;
+```
+
+It produces the following output:
+
+```
+% ./fype arrays.fy
+bar
+01
+2
+3.000000
+A
+BA
+BB
+```
+
+## Fancy stuff
+
+Fancy stuff like OOP or Unicode or threading is not planed. But fancy stuff like function pointers and closures may be considered.:) 
+
+## May the source be with you
+
+You can find all of this on the GitHub page. There is also an "examples" folders containing some Fype scripts!
+
+[https://github.com/snonux/fype](https://github.com/snonux/fype)
+
+E-Mail me your thoughts at comments@mx.buetow.org!
diff --git a/content/md/gemfeed/2011-05-07-perl-daemon-service-framework.md b/content/md/gemfeed/2011-05-07-perl-daemon-service-framework.md
new file mode 100644
index 00000000..4341a99d
--- /dev/null
+++ b/content/md/gemfeed/2011-05-07-perl-daemon-service-framework.md
@@ -0,0 +1,163 @@
+> Written by Paul Buetow 2011-05-07, last updated 2021-05-07
+
+[Go back to the main site](../)
+
+# Perl Daemon (Service Framework)
+
+```
+   a'!   _,,_ a'!   _,,_     a'!   _,,_
+     \\_/    \  \\_/    \      \\_/    \.-,
+      \, /-( /'-,\, /-( /'-,    \, /-( /
+      //\ //\\   //\ //\\       //\ //\\jrei
+```
+
+PerlDaemon is a minimal daemon for Linux and other Unix like operating systems programmed in Perl. It is a minimal but pretty functional and fairly generic service framework. This means that it does not do anything useful other than providing a framework for starting, stopping, configuring and logging. In order to do something useful, a module (written in Perl) must be provided.
+
+## Features
+
+PerlDaemon supports:
+
+* Automatic daemonizing
+* Logging
+* logrotation (via SIGHUP)
+* Clean shutdown support (SIGTERM)
+* Pid file support (incl. check on startup)
+* Easy to configure
+* Easy to extend
+* Multi instance support (just use a different directory for each instance).
+
+## Quick Guide
+
+```
+# Starting
+ ./bin/perldaemon start (or shortcut ./control start)
+
+# Stopping
+ ./bin/perldaemon stop (or shortcut ./control stop)
+
+# Alternatively: Starting in foreground 
+./bin/perldaemon start daemon.daemonize=no (or shortcut ./control foreground)
+```
+
+To stop a daemon running in foreground mode "Ctrl+C" must be hit. To see more available startup options run "./control" without any argument.
+
+## How to configure
+
+The daemon instance can be configured in "./conf/perldaemon.conf". If you want to change a property only once, it is also possible to specify it on command line (that then will take precedence over the config file). All available config properties can be viewed via "./control keys":
+
+```
+pb@titania:~/svn/utils/perldaemon/trunk$ ./control keys
+# Path to the logfile
+daemon.logfile=./log/perldaemon.log
+
+# The amount of seconds until the next event look takes place
+daemon.loopinterval=1
+
+# Path to the modules dir
+daemon.modules.dir=./lib/PerlDaemonModules
+
+# Specifies either the daemon should run in daemon or foreground mode
+daemon.daemonize=yes
+
+# Path to the pidfile
+daemon.pidfile=./run/perldaemon.pid
+
+# Each module should run every runinterval seconds
+daemon.modules.runinterval=3
+
+# Path to the alive file (is touched every loopinterval seconds, usable to monitor)
+daemon.alivefile=./run/perldaemon.alive
+
+# Specifies the working directory
+daemon.wd=./
+```
+
+## Example 
+
+So lets start the daemon with a loop interval of 10 seconds:
+
+```
+$ ./control keys | grep daemon.loopinterval
+daemon.loopinterval=1
+$ ./control keys daemon.loopinterval=10 | grep daemon.loopinterval
+daemon.loopinterval=10
+$ ./control start daemon.loopinterval=10; sleep 10; tail -n 2 log/perldaemon.log
+Starting daemon now...
+Mon Jun 13 11:29:27 2011 (PID 2838): Triggering PerlDaemonModules::ExampleModule 
+(last triggered before 10.002106s; carry: 7.002106s; wanted interval: 3s)
+Mon Jun 13 11:29:27 2011 (PID 2838): ExampleModule Test 2
+$ ./control stop
+Stopping daemon now...
+```
+
+If you want to change that property forever either edit perldaemon.conf or do this:
+
+```
+$ ./control keys daemon.loopinterval=10 > new.conf; mv new.conf conf/perldaemon.conf
+```
+
+## HiRes event loop
+
+PerlDaemon uses `Time::HiRes` to make sure that all the events run in correct intervals. Each loop run a time carry value is recorded and added to the next loop run in order to catch up lost time.
+
+## Writing your own modules
+
+### Example module
+
+This is one of the example modules you will find in the source code. It should be quite self-explanatory if you know Perl :-).
+
+```
+package PerlDaemonModules::ExampleModule;
+
+use strict;
+use warnings;
+
+sub new ($$$) {
+  my ($class, $conf) = @_;
+
+  my $self = bless { conf => $conf }, $class;
+
+  # Store some private module stuff
+  $self->{counter} = 0;
+
+  return $self;
+}
+
+# Runs periodically in a loop (set interval in perldaemon.conf)
+sub do ($) {
+  my $self = shift;
+  my $conf = $self->{conf};
+  my $logger = $conf->{logger};
+
+  # Calculate some private module stuff
+  my $count = ++$self->{counter};
+
+  $logger->logmsg("ExampleModule Test $count");
+}
+
+1;
+```
+
+### Your own module
+
+Want to give it some better use? It's just a easy as:
+
+```
+ cd ./lib/PerlDaemonModules/
+ cp ExampleModule.pm YourModule.pm
+ vi YourModule.pm
+ cd -
+ ./bin/perldaemon restart (or shortcurt ./control restart)
+```
+
+Now watch `./log/perldaemon.log` closely. It is a good practise to test your modules in 'foreground mode' (see above how to do that).
+
+BTW: You can install as many modules within the same instance as desired. But they are run in sequential order (in future they can also run in parallel using several threads or processes).
+
+## May the source be with you
+
+You can find PerlDaemon (including the examples) at:
+
+[https://github.com/snonux/perldaemon](https://github.com/snonux/perldaemon)
+
+E-Mail me your thoughts at comments@mx.buetow.org!
diff --git a/content/md/gemfeed/2016-04-03-offsite-backup-with-zfs.md b/content/md/gemfeed/2016-04-03-offsite-backup-with-zfs.md
new file mode 100644
index 00000000..d044f319
--- /dev/null
+++ b/content/md/gemfeed/2016-04-03-offsite-backup-with-zfs.md
@@ -0,0 +1,42 @@
+> Written by Paul Buetow 2016-04-03
+
+[Go back to the main site](../)
+
+# Offsite backup with ZFS
+
+```
+ ________________
+|# :           : #|
+|  : ZFS/GELI  :  |
+|  :   Offsite :  |
+|  :  Backup   :  |
+|  :___________:  |
+|     _________   |
+|    | __      |  |
+|    ||  |     |  |
+\____||__|_____|__|
+```
+
+## Please don't lose all my pictures again!
+
+When it comes to data storage and potential data loss I am a paranoid person. It is not just due to my job but also due to a personal experience I encountered over 10 years ago: A