On Fri, 02 May 2014 21:51:02 +0200
Axb wrote:
> > 2) The non-amenable rules are processed, but may be slower than if
> > they weren't compiled?
>
> yep
It means they get processed as normal in perl, so they don't get
speeded-up, but they aren't slowed-down.
On 05/03/2014 01:18 PM, RW wrote:
On Fri, 02 May 2014 21:51:02 +0200
Axb wrote:
2) The non-amenable rules are processed, but may be slower than if
they weren't compiled?
yep
It means they get processed as normal in perl, so they don't get
speeded-up, but they aren't slowed-down.
correct
On Sat, 3 May 2014, RW wrote:
On Fri, 02 May 2014 21:51:02 +0200
Axb wrote:
2) The non-amenable rules are processed, but may be slower than if
they weren't compiled?
yep
It means they get processed as normal in perl, so they don't get
speeded-up, but they aren't slowed-down.
One thing,
On Apr 30, 2014, at 5:05 AM, Christian Laußat
wrote:
> Am 30.04.2014 12:34, schrieb Michael Storz:
>> Am 2014-04-30 11:00, schrieb Axb:
>>> On 04/30/2014 10:30 AM, Michael Storz wrote:
>>> and in the meantime may want to look at
>>> http://sourceforge.net/projects/opendmarc/
>> OpenDMARC is ok