Sponsored Content
Top Forums UNIX for Beginners Questions & Answers Answers to Frequently Asked Questions Email Antispam Techniques and Email Filtering frustrated "No match on" regular expression Post 50161 by jones on Saturday 17th of April 2004 02:29:15 PM
Old 04-17-2004
frustrated "No match on" regular expression

Code:
[frustrated "No match on" regular expression]
attempt to filter "dsl.[many].pacbell.net
. . .any pointers?

/etc/procmailrc
# attempt at egrep regular expression to match 
# adsl-63-199-245-128.dsl.snd g02.pacbell.net [63.199.245.128]
VERBOSE = yes
:0
* ^Received:.*dsl+\.[-a-z0-9_]+\.pacbell+\.net
{
  LOG="(PacBell DSL)  "
  :0
  /zzPacbellDSL
}  
VERBOSE = no

/var/log/procmail.log
procmail: [11390] Sat Apr 17 13:57:12 2004
procmail: No match on "^Received:*dsl+\.[-a-z0-9_]+\.pacbell+\.net"
procmail: Assigning "VERBOSE=no"
From VYYGRGPXNXV@msn.com  Sat Apr 17 13:57:12 2004
  Folder: /var/spool/mail/frank                                         1307

/var/log/maillog
Apr 17 13:57:12 mailhost sendmail[11384]: i3HHv4Q11384: from=, size=883, class=0, nrcpts=1, msgid=<200404171757.i3HHv4Q11384@mailhost.justjones.org>, proto=SMTP, daemon=MTA, relay=adsl-63-199-245-128.dsl.snd
g02.pacbell.net [63.199.245.128]
---end---

 

9 More Discussions You Might Find Interesting

1. Linux

Regular expression to extract "y" from "abc/x.y.z" .... i need regular expression

Regular expression to extract "y" from "abc/x.y.z" (2 Replies)
Discussion started by: rag84dec
2 Replies

2. Shell Programming and Scripting

cshell integer expression from "0000" to "1999"

I have 2000 files named like "file-fr0000.log", "file-fr1999.log"... I wanna generate the file names automatically in the following c shell script: set fr = 0 while ($fr <= 1999) grep "ENERGY" file-fr$fr.log > data.dat @ fr = ( $fr + 1 ) end The above will generate file names... (3 Replies)
Discussion started by: rockytodd
3 Replies

3. Shell Programming and Scripting

Regular Expression doesn't match dot "." in a string

hello, I am writting a regular expression that intend to match any tunnel or serial interface but it doesn't mtach any serial sub-interface. For example, statement should match "Tunnel3" or "Serial0/1" but shouldn't match "Serial0\1.1" (doesn't include dot ".") I tried the following but... (3 Replies)
Discussion started by: ahmed_zaher
3 Replies

4. Shell Programming and Scripting

awk command to replace ";" with "|" and ""|" at diferent places in line of file

Hi, I have line in input file as below: 3G_CENTRAL;INDONESIA_(M)_TELKOMSEL;SPECIAL_WORLD_GRP_7_FA_2_TELKOMSEL My expected output for line in the file must be : "1-Radon1-cMOC_deg"|"LDIndex"|"3G_CENTRAL|INDONESIA_(M)_TELKOMSEL"|LAST|"SPECIAL_WORLD_GRP_7_FA_2_TELKOMSEL" Can someone... (7 Replies)
Discussion started by: shis100
7 Replies

5. Shell Programming and Scripting

why "aab" matchs "ab" when using reglar expression ?

Please see the following code, why "aab" matchs "ab" when using reglar expression ? $ ] && echo "ok" || echo "error"; ok $ ] && echo "ok" || echo "error"; error $ ] && echo "ok" || echo "error"; error $ ] && echo... (8 Replies)
Discussion started by: 915086731
8 Replies

6. UNIX for Advanced & Expert Users

AIX - io info get from "libperfstat" not match "iostat"

Hi, everyone. I need to write a program to get io info based on libperfstat. But the "write time" of a disk is just half of the value get from iostat. I'm confused and can't explain. Help please. How I calculate "write service time per sec": In iostat: write service... (0 Replies)
Discussion started by: jackliang
0 Replies

7. UNIX for Dummies Questions & Answers

Using "mailx" command to read "to" and "cc" email addreses from input file

How to use "mailx" command to do e-mail reading the input file containing email address, where column 1 has name and column 2 containing “To” e-mail address and column 3 contains “cc” e-mail address to include with same email. Sample input file, email.txt Below is an sample code where... (2 Replies)
Discussion started by: asjaiswal
2 Replies

8. Shell Programming and Scripting

Bash script - Print an ascii file using specific font "Latin Modern Mono 12" "regular" "9"

Hello. System : opensuse leap 42.3 I have a bash script that build a text file. I would like the last command doing : print_cmd -o page-left=43 -o page-right=22 -o page-top=28 -o page-bottom=43 -o font=LatinModernMono12:regular:9 some_file.txt where : print_cmd ::= some printing... (1 Reply)
Discussion started by: jcdole
1 Replies

9. Shell Programming and Scripting

Search file containing ps results for a match "my.cnf" and then for a second match . "ok:" and

I need to find two matches in the output from ps. I am searching with ps -ef |grep mysql for: my.cnf /bin/sh /usr/bin/mysqld_safe --defaults-file=/data/mysql/master/agis_core/etc/my.cnf after this match I want to search back and match the hostname which is x number of lines back, above the... (2 Replies)
Discussion started by: bash_in_my_head
2 Replies
PROCMAILSC(5)							File Formats Manual						     PROCMAILSC(5)

NAME
procmailsc - procmail weighted scoring technique SYNOPSIS
[*] w^x condition DESCRIPTION
In addition to the traditional true or false conditions you can specify on a recipe, you can use a weighted scoring technique to decide if a certain recipe matches or not. When weighted scoring is used in a recipe, then the final score for that recipe must be positive for it to match. A certain condition can contribute to the score if you allocate it a `weight' (w) and an `exponent' (x). You do this by preceding the con- dition (on the same line) with: w^x Whereas both w and x are real numbers between -2147483647.0 and 2147483647.0 inclusive. Weighted regular expression conditions The first time the regular expression is found, it will add w to the score. The second time it is found, w*x will be added. The third time it is found, w*x*x will be added. The fourth time w*x*x*x will be added. And so forth. This can be described by the following concise formula: n n k-1 x - 1 w * Sum x = w * ------- k=1 x - 1 It represents the total added score for this condition if n matches are found. Note that the following case distinctions can be made: x=0 Only the first match will contribute w to the score. Any subsequent matches are ignored. x=1 Every match will contribute the same w to the score. The score grows linearly with the number of matches found. 0<x<1 Every match will contribute less to the score than the previous one. The score will asymptotically approach a certain value (see the NOTES section below). 1<x Every match will contribute more to the score than the previous one. The score will grow exponentially. x<0 Can be utilised to favour odd or even number of matches. If the regular expression is negated (i.e., matches if it isn't found), then n obviously can either be zero or one. Weighted program conditions If the program returns an exitcode of EXIT_SUCCESS (=0), then the total added score will be w. If it returns any other exitcode (indicat- ing failure), the total added score will be x. If the exitcode of the program is negated, then, the exitcode will be considered as if it were a virtual number of matches. Calculation of the added score then proceeds as if it had been a normal regular expression with n=`exitcode' matches. Weighted length conditions If the length of the actual mail is M then: * w^x > L will generate an additional score of: x / M w * | --- | L / And: * w^x < L will generate an additional score of: x / L w * | --- | M / In both cases, if L=M, this will add w to the score. In the former case however, larger mails will be favoured, in the latter case, smaller mails will be favoured. Although x can be varied to fine-tune the steepness of the function, typical usage sets x=1. MISCELLANEOUS
You can query the final score of all the conditions on a recipe from the environment variable $=. This variable is set every time just after procmail has parsed all conditions on a recipe (even if the recipe is not being executed). EXAMPLES
The following recipe will ditch all mails having more than 150 lines in the body. The first condition contains an empty regular expression which, because it always matches, is used to give our score a negative offset. The second condition then matches every line in the mail, and consumes up the previous negative offset we gave (one point per line). In the end, the score will only be positive if the mail con- tained more than 150 lines. :0 Bh * -150^0 * 1^1 ^.*$ /dev/null Suppose you have a priority folder which you always read first. The next recipe picks out the priority mail and files them in this special folder. The first condition is a regular one, i.e., it doesn't contribute to the score, but simply has to be satisfied. The other condi- tions describe things like: john and claire usually have something important to say, meetings are usually important, replies are favoured a bit, mails about Elvis (this is merely an example :-) are favoured (the more he is mentioned, the more the mail is favoured, but the maxi- mum extra score due to Elvis will be 4000, no matter how often he is mentioned), lots of quoted lines are disliked, smileys are appreciated (the score for those will reach a maximum of 3500), those three people usually don't send interesting mails, the mails should preferably be small (e.g., 2000 bytes long mails will score -100, 4000 bytes long mails do -800). As you see, if some of the uninteresting people send mail, then the mail still has a chance of landing in the priority folder, e.g., if it is about a meeting, or if it contains at least two smileys. :0 HB * !^Precedence:.*(junk|bulk) * 2000^0 ^From:.*(john@home|claire@work) * 2000^0 ^Subject:.*meeting * 300^0 ^Subject:.*Re: * 1000^.75 elvis|presley * -100^1 ^> * 350^.9 :-) * -500^0 ^From:.*(boss|jane|henry)@work * -100^3 > 2000 priority_folder If you are subscribed to a mailinglist, and just would like to read the quality mails, then the following recipes could do the trick. First we make sure that the mail is coming from the mailinglist. Then we check if it is from certain persons of whom we value the opinion, or about a subject we absolutely want to know everything about. If it is, file it. Otherwise, check if the ratio of quoted lines to orig- inal lines is at most 1:2. If it exceeds that, ditch the mail. Everything that survived the previous test, is filed. :0 ^From mailinglist-request@some.where { :0: * ^(From:.*(paula|bill)|Subject:.*skiing) mailinglist :0 Bh * 20^1 ^> * -10^1 ^[^>] /dev/null :0: mailinglist } For further examples you should look in the procmailex(5) man page. CAVEATS
Because this speeds up the search by an order of magnitude, the procmail internal egrep will always search for the leftmost shortest match, unless it is determining what to assign to MATCH, in which case it searches the leftmost longest match. E.g. for the leftmost shortest match, by itself, the regular expression: .* will always match a zero length string at the same spot. .+ will always match one character (except newlines of course). SEE ALSO
procmail(1), procmailrc(5), procmailex(5), sh(1), csh(1), egrep(1), grep(1), BUGS
If, in a length condition, you specify an x that causes an overflow, procmail is at the mercy of the pow(3) function in your mathematical library. Floating point numbers in `engineering' format (e.g., 12e5) are not accepted. MISCELLANEOUS
As soon as `plus infinity' (2147483647) is reached, any subsequent weighted conditions will simply be skipped. As soon as `minus infinity' (-2147483647) is reached, the condition will be considered as `no match' and the recipe will terminate early. NOTES
If in a regular expression weighted formula 0<x<1, the total added score for this condition will asymptotically approach: w ------- 1 - x In order to reach half the maximum value you need - ln 2 n = -------- ln x matches. AUTHORS
Stephen R. van den Berg <srb@cuci.nl> Philip A. Guenther <guenther@sendmail.com> BuGless 2001/08/04 PROCMAILSC(5)
All times are GMT -4. The time now is 03:38 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy