Re: Looking for ideas on how to optimize this specialized grep
by JavaFan (Canon) on Jan 21, 2011 at 20:07 UTC
|
what could I do for free? There's no such thing as a free lunch. But if you do this often enough, and it takes so much time you're willing to spend time to optimize it, then why not collect the information when the mail arrives? Just use a disk tied hash (for instance, some DB_File solution), and for each mail that arrives, increment the appropriate value.
Then whenever you want to see the counts, you just get the values from a hash instead of having to parse a huge file.
| [reply] |
|
|
In this case, it was just something I wondered about my existing email. I have email going back 10+ years and this was the first time I wondered about it, so it is unlikely to be something I want to do regularly. I can see that logging when it is received would move the processing to a time when I don't have to wait for it, but I didn't plan that far ahead.
| [reply] |
|
|
If you only do this once every 10 years, do you really have a need to optimize?
| [reply] |
|
|
Re: Looking for ideas on how to optimize this specialized grep
by furry_marmot (Pilgrim) on Jan 22, 2011 at 00:39 UTC
|
I can think of a few things. First, read the header block all at once. That will reduce the number of reads to one per file.
Then anchor the regex on the beginning of a line. Specifically, only look on the To: line (I leave the Cc: line, as well as multiple addressees, as an excercise for later) and lose the /s modifier. The regex will fail immediately on any line that doesn't start with To:, only searching for email addresses on the rest of the To: line. This will reduce the number of matches to one per file.
Do a case-insensitive match, rather than lower casing the line. This will be one less operation per file.
#!/usr/bin/perl
use strict;
use warnings;
use File::Find;
use YAML::Syck;
my %addresses;
find(sub {
return unless -f $_;
open my $fh, '<', $_ or die;
local $/ = ''; # "Paragraph" mode, reads a block of text to n
+ext \n\n
$_ = <$fh>; # Read Header block
if (/To:.+\b(andrew\+[^\@\s]+\@[-a-z0-9\.]+)\b/mi) { # /m to ancho
+r, /i to ignore case
my $addr = $1;
# some addresses are in mailing list bounce format
if ($addr =~ s/[=\#\%](?:3d)?/@/) { # No need for /xms her
+e
$addr =~ s/\@[^@]+$//;
}
$addresses{$addr}++;
}
close $fh;
}, glob($ENV{HOME} . '/Maildir/.misc*'));
print Dump \%addresses;
You're using the /x, /m, and /s modifiers already, but I'm not sure you understand how to use them. /x allows you to put in whitespace for clarity, requiring you to use \s to match whitespace.
/To:.+
\b
(
andrew\+
[^\@\s]+
\@
[-a-z0-9\.]+
)
\b
/mix
The \s is fine in your original code, but you're not actually using any whitespace for clarity, so /x is unneeded.
Same with /s, where . matches newlines as if they were whitespace. For example, in the text below, /upon.+little/s would find a match,
Once upon a time\n
there was a little prince\n
named Lord Fancypants.\n
while /upon.+little/ would not because . won't match a newline without /s.
Finally, /m allows you to match ^ and $ on a "line" -- that is, after and before a newline embedded in a block of text. So /^there/ would not find a match, while /^there/m would.
Once upon a time\n
there was a little prince\n
named Lord Fancypants.\n
And /^there.+/m would match "there was a little prince", while /^there.+/ms would match
Once upon a time\n
there was a little prince\n
named Lord Fancypants.\n
Similarly, in your substitution, $addr =~ s/[=\#\%](?:3d)?/@/xms, you're not using whitespace for clarity, nor are you anchoring on the beginning or end of a line, nor should your match ever go over a newline. I'm not sure if it would make a performance difference, but you could just drop the /xms entirely, as I did above.
I hope this helps.
--marmot | [reply] [d/l] [select] |
|
|
So you think setting $/ = "\n\n" and ($headers) = <$fh> should be faster? Sounds very interesting.
Then regex against $headers and anchor against specific headers. But, many addresses are "hidden" in the first received header because of mailing lists or other things, because of that I had looked at the entire header. Maybe /(?:^To:\s+|^CC:\s+|<)$address/ms?
I lowercased the entire line because I thought that would be faster than a case insensitive regex.
I generally use /xms on all my regexes as that is how I expect them to work, and if I add them, it doesn't hurt even if I don't use the feature. Is there a reason NOT to use /x and /s? Do they slow down the regex?
Thank you for many things to try to figure out setting up a benchmarks for.
| [reply] [d/l] [select] |
|
|
So you think setting $/ = "\n\n" and ($headers) = <$fh> should be faster?
It's $/ = '', not $/ = "\n\n". It's just the way it works. And setting it to $/ = undef will slurp in the whole file. Anyway, yes, I think one file read and one match will be a lot faster than a dozen or so reads and a dozen or so matches, depending on the particular header.
Then regex against $headers and anchor against specific headers. But, many addresses are "hidden" in the first received header because of mailing lists or other things, because of that I had looked at the entire header. Maybe /(?:^To:\s+|^CC:\s+|<)$address/ms?
Well, you have to adjust the regex to your needs, but as I said, it's one match that covers all the places the address could be...including the whole header block, if necessary, versus a bunch of reads and matches.
I generally use /xms on all my regexes as that is how I expect them to work, and if I add them, it doesn't hurt even if I don't use the feature. Is there a reason NOT to use /x and /s? Do they slow down the regex?
My feeling is that setting features you don't use as defaults is a bad practice. Programming is very much a thinking endeavor. Always setting /xms and can lead to some very nasty bugs when you forget what those options actually mean or that you have set them. For example, '+' is greedy. Once you have a basic match, like m/Start.+finish/s for example, this regex will search all the way to the end of the block of text and start working backwards to find 'finish'. Without the /s modifier, it only searches to the next newline to start working backwards.
Similarly, /m just lets you match ^ and $ against embedded newlines. If you forget and search for m/^Something/m, you might get unexpected results. They are just tools. You can write code that always accommodates the use of those modifiers, but why? It's like deciding that you will always use a screwdriver, even when you don't need it. It's odd...
Anyway, I stripped the code to its basics and benchmarked it. The one read/one match approach is about 30% faster than your approach, so there ya go. Also, I copied sub1 and sub3 as sub2 and sub4, and then changed the regex to use or not use /xms. Turns out sub4 runs about 2% more slowly than sub3, probably because the particular regex does a lot of backtracking. sub2, where I removed the /xms, runs about 10% more slowly! I've run it a few times, and it's consistent. I didn't expect that and don't understand it.
Cheers!
--marmot
#!/usr/bin/perl
use strict;
use warnings;
use File::Find;
use Benchmark qw(:all) ;
sub sub1 {
my %addresses;
open my $fh, '<test.eml' or die;
while (<$fh>) {
last if $_ eq "\n"; # only scan headers
$_ = lc $_;
if (/\b(johnqp\@mailserver\.com)/xms) {
my $addr = $1;
$addresses{$addr}++;
}
}
close $fh;
}
sub sub2 {
my %addresses;
open my $fh, '<test.eml' or die;
while (<$fh>) {
last if $_ eq "\n"; # only scan headers
$_ = lc $_;
if (/\b(johnqp\@mailserver\.com)/) {
my $addr = $1;
$addresses{$addr}++;
}
}
close $fh;
}
sub sub3 {
my %addresses;
open my $fh, '<test.eml' or die;
local $/ = '';
$_ = <$fh>;
if (/^(?:To|Cc):.+(johnqp\@mailserver\.com)/mi) {
my $addr = $1;
$addresses{$addr}++;
}
close $fh;
}
sub sub4 {
my %addresses;
open my $fh, '<test.eml' or die;
local $/ = '';
$_ = <$fh>;
if (/^(?:To|Cc):.+(johnqp\@mailserver\.com)/xsmi) {
my $addr = $1;
$addresses{$addr}++;
}
close $fh;
}
cmpthese(100000, {
'Linewise' => \&sub1,
'Line no /xms' => \&sub2,
'Blockwise' => \&sub3,
'Block /xms' => \&sub4,
});
<STDIN>;
__END__
Rate Line no /xms Linewise Block /xms Blockwis
+e
Linewise 3256/s 11% -- -22% -24
+%
Line no /xms 2946/s -- -10% -30% -31
+%
Blockwise 4282/s 45% 32% 2% -
+-
Block /xms 4198/s 43% 29% -- -2
+%
| [reply] [d/l] [select] |
|
|
|
|
|
|
I didn't understand s and m switch of regex until furry_marmot's explanation... man perlre says about /ms
'let the "." match any character whatsoever, while still allowing "^" and "$" to match, respectively, just after and just before newlines within the string'
I didn't think of example that needs this. Do you have any example case like 'little princess' example for /ms?
As for block mode of this example, I saw this way in awk script. I first met this way($\='') in perl.
People sometimes say regex is slow, so I tried to use index function insted of regex. But it seems not improving time. I simplified just to pick up From address in this example and index version needs utf8 treatment for index and substr.
use strict;
use warnings;
use File::Find;
use Data::Dumper;
my %addresses;
sub test1 {
my ($from);
find(sub {
return unless -f $_;
open my $fh, '<', $_ or die;
local $/ = ''; # "Paragraph" mode, reads a block of t
+ext to next \n\n
$_ = <$fh>; # Read Header block
($from)= $_ =~ /^From:(.*)/m; # /m to anchor
#print "$from\n";
close $fh;
}, glob('./009_mailtest/*'));
#print Dumper \%addresses;
}
sub test2{
binmode(STDOUT,":utf8");
my ($from,$bgn,$end,$len);
find(sub {
return unless -f $_;
open my $fh, '<:utf8', $_ or die;
local $/ = ''; # "Paragraph" mode, reads a block of t
+ext to next \n\n
$_ = <$fh>; # Read Header block
$bgn=index($_,"From:",0) + length("From:");
$end=index($_,chr(10),$bgn+1);
$len=$end - $bgn;
$from=substr($_, $bgn, $len);
#print "$from\n";
close $fh;
}, glob('./009_mailtest/*'));
}
my($start,$end);
$start=(times)[0];
&test1;
$end=(times)[0];
print "with regex=" . ($end - $start) . "sec\n";
$start=(times)[0];
&test2;
$end=(times)[0];
print "without regex=" . ($end - $start) . "sec\n";
The result for my 319Mb test mail box was like this.
with regex=0.296875sec
without regex=0.34375sec
| [reply] [d/l] |
|
|
$text = <<'EOT';
Message-ID: <ODM2bWFpbGVyLmRpZWJlYS40MjYyNjE2LjEyOTU1NDE2MTg=@out-p-h.
+customernews.net>
From: "GenericOnline Pharmacy" <marmot@furrytorium.com>
To: "Angie Morestead" <marmot@furrytorium.com>
Subject: Buy drugs online now!
Date: Thu, 20 Jan 2011 18:40:18 +0200
Content-Type: multipart/related; boundary="----=_Weigard_drugs_CG_0"
EOT
$text =~ /^Subject:.+drugs/m; # Anchor just after \n, before Subject.
# Matches 'Subject: Buy drugs'
$text =~ /\nSubject:.+drugs/; # Equivalent
$text =~ /^Subject:.+drugs/ms; # '.' matches newlines, all the way to
# '..._Weigard_drugs', which is not wh
+at we wanted.
$text =~ /^Subject:.+?drugs/ms; # '.' matches newlines, but searches f
+rom current string
# position, stopping when it matches '
+Subject: Buy drugs'.
# This is a little slower than the fir
+st two, but
# equivalent. /s is countered by the .
++?, but if 'drugs'
# was not in the Subject line, the reg
+ex would keep keep
# on going.
# Here are some fun ones.
# The email address should be "Furry Marmot" <marmot@furrytorium.com>,
+ or just
# marmot@furrytorium.com. Anything else is spam.
print "Spam!!!\n"
if $text =~ /^(?:From|To):\s*"(?!.+Furry Marmot)[^"]*" <marmot\@fu
+rrytorium\.com>/m;
# Regarding the [^"]*, if the regex finds Furry Marmot in quotes, it f
+ails and this isn't
# spam. But if it finds something else, we still have to match somethi
+ng between the
# quotes, and then match the email to determine if it is spam.
# I should never see anything from me, to me.
print "Spam!!!\n" if
$text =~ /(?=^From:[^\n]+marmot\@furrytorium\.com).+^To:[^\n]+marm
+ot\@furrytorium\.com/ms;
# This starts at the beginning of header block, finds From: line with
+my email address,
# resets to start of block (because of zero-width lookahead assertion)
+, then finds To:
# line with my email address. It is the equivalent of...
if ($text =~ /^From:.+marmot\@furrytorium\.com)/m && /^To:.+marmot\@fu
+rrytorium\.com/m) {
print "Spam!!!\n"
}
# ...but I can include the single pattern in a list of patterns that I
+ might want to match
# against the string.
>> People sometimes say regex is slow
It depends on how it's used. The regex engine is actually pretty quick, but there are certain things that can really slow it down. It's been a while since I read Friedl's book, but basically the search engine looks for the start of a pattern, and then tries to find the rest. If the rest is not there, it backs out of what it was able to match and goes looking again.
So just searching for /^From:.+marmot/m, it will first look for the beginning of the text, and then look at each character for a newline. Once it has that, it looks to see if the next character is an 'F'. If not, it backtracks and searches for the next newline. Once it finds 'From:', it looks again for a newline (because we're not using /s), and works back to see if it can find 'marmot'. If not, it backs out of the 'From:' it has matched so far and goes looking for another 'From:' line.
More complex searches can cause it to backtrack up a storm. But a well-constructed regex can minimize that. Index is probably faster at searching for plaintext, but it can't search for patterns, which limits its usefulness.
--marmot | [reply] [d/l] [select] |
|
|
|
|
|