search for: l233

Hello, The code here https://github.com/gsliepen/tinc/blob/master/src/graph.c#L150-L233 looks like the SSSP for indirect data forwarding is generated by looking for the minimal number of hops. Is there any possibilities or plan to generate the SSSP by using the weights of edges. And, is there any plan to add an option to allow indirect data forwards if the direct UDP channel is worse...

I came across a weird-looking use of LLVM_FALLTHROUGH which I think is completely spurious, but I figured I should check with the group mind before ripping it out. Basically, if you have multiple cases with no code in between, you do *not* need LLVM_FALLTHROUGH, right? switch (Foo) { case Bar1: LLVM_FALLTHROUGH; // not needed case Bar2: some code; return; case Bar3:

Hi all, Following the instructions noted at http://wiki2.dovecot.org/Pigeonhole/Sieve/Plugins/Pipe , I am trying to make use of the Pigeonhole sieve pipe plugin to execute an application with custom arguments via my test sieve script: require ["vnd.dovecot.pipe"]; if address :is "to" "test at example.com" { pipe :args [ "first-arg",