|
|
1.1 ! root 1: divert(10) ! 2: # ! 3: # Copyright (c) 1983 Eric P. Allman ! 4: # Copyright (c) 1988 The Regents of the University of California. ! 5: # All rights reserved. ! 6: # ! 7: # Redistribution and use in source and binary forms are permitted ! 8: # provided that the above copyright notice and this paragraph are ! 9: # duplicated in all such forms and that any documentation, ! 10: # advertising materials, and other materials related to such ! 11: # distribution and use acknowledge that the software was developed ! 12: # by the University of California, Berkeley. The name of the ! 13: # University may not be used to endorse or promote products derived ! 14: # from this software without specific prior written permission. ! 15: # THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 16: # IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 17: # WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 18: # ! 19: # @(#)smtpuucpm.m4 1.2 (Berkeley) 2/15/89 ! 20: # ! 21: divert(0) ! 22: ############################################################ ! 23: ############################################################ ! 24: ##### ! 25: ##### SMTP UUCP Mailer specification ! 26: ##### ! 27: ##### This mailer sends UUCP traffic over an SMTP connection. ! 28: ##### Obviously, we only want to do this with UUCP hosts with ! 29: ##### whom we have SMTP connectivity. The idea here is to ! 30: ##### avoid having to double queue (once for sendmail, once ! 31: ##### for UUCP) when there's no need. Since we need to ! 32: ##### preserve uucp-ness (e.g., bangs), we use the UUCP mailer ! 33: ##### rewriting rulesets. ! 34: ##### ! 35: ############################################################ ! 36: ############################################################ ! 37: ! 38: Msmtpuucp, P=[IPC], F=mDFMueXLC, S=13, R=23, A=IPC $h, E=\r\n ! 39: ! 40: define(SMTPUUCPPAIR, ! 41: `R<@$1.uucp>:$+ $`#'smtpuucp$@$2$:`$'2 ! 42: R$*<@$1.uucp> $`#'smtpuucp$@$2$:`$'1')
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.