DIRECTORY
Ascii USING [CR, LF, SP, TAB],
IO USING [EndOf, EndOfStream, GetBlock, GetChar, GetIndex, PeekChar, Put, PutBlock, PutChar, PutF, PutFR, PutRope, RIS, rope, SetIndex, STREAM],
List USING [Nconc1],
RefText USING [ObtainScratch, ReleaseScratch],
Rope USING [Cat, Equal, Fetch, Find, IsEmpty, Length, ROPE],
PrincOpsUtils USING [Codebase],

Lex822 USING [CharProc, GetSequence, LexFieldName, LexText, LexToken],
MT USING[Direction],
MTMiscOps USING [Lookup, Table],
MTP1 USING [GetEvalResult, InstallParseTable, Parse, ScannerProc, ScanDate, ScanName],
MTParseData,
MTTreeOps: TYPE USING [DefaultDomain, discretionaryBlank, DomainType, TreeToRope, TreeToSimpleRope, ToArpa, ToGrapevine, XeroxDomain];
MTMain: CEDAR MONITOR -- Parser has lots of global data
IMPORTS
IO, List, MTMiscOps, PrincOpsUtils, RefText, Rope, Lex822,
MTP1, MTParseData, MTTreeOps
EXPORTS MT =
BEGIN OPEN P1: MTP1;
ROPE: TYPE = Rope.ROPE;

nameFields: MTMiscOps.Table ~ LIST["from", "sender", "to", "cc", "bcc", "reply-to", "resent-from", "resent-sender", "resent-to", "resent-cc", "resent-bcc", "resent-reply-to", "remailed-from", "remailed-sender", "remailed-to", "remailed-cc", "remailed-bcc"];
msgID: ROPE = "Message-ID";
lineFold: ROPE = "Line-Fold";

HeaderRec: TYPE = RECORD[
name: Rope.ROPE,
fieldType: {textField, dateField, nameField},
body: REF ANY];   -- Rope for text and whatever MTP1.GetEvalResult returns for others

Info: TYPE = REF InfoRec;
InfoRec: PUBLIC TYPE = RECORD [
id: ROPE _ NIL,
foldLines: BOOL, -- TRUE if we should fold lines for this message.
defaultDomainType: MTTreeOps.DomainType, -- defaults for translate routines
defaultDomain: REF ANY,
headers: LIST OF REF ANY ]; -- really LIST OF REF HeaderRec, but I need the List ops
foldLength: INT _ 72;      -- How long to make folded lines.
alreadyFoldedLength: INT _ 90;   -- Max a line can be and still appear to be folded.
alreadyFoldedLookahead: INT _ 5000;  -- Look at this many chars to decide if folded.
InitParser: PROC = TRUSTED {
P1.InstallParseTable[LOOPHOLE[PrincOpsUtils.Codebase[LOOPHOLE[MTParseData]]]]; };
IsNameFieldHeader: PROC [fieldName: Rope.ROPE] RETURNS [BOOL] = {
RETURN [MTMiscOps.Lookup[fieldName, nameFields]];
};
AlreadyFolded: PROC [in: IO.STREAM] RETURNS [isFolded: BOOL] = {
pos: INT _ in.GetIndex[];
curLength, maxLength: INT _ 0;
count: INT _ 0;
WHILE count < alreadyFoldedLookahead AND ~in.EndOf[] DO
IF in.GetChar[] = Ascii.CR THEN {
IF curLength > maxLength THEN maxLength _ curLength;
curLength _ 0; }
ELSE curLength _ curLength+1;
count _ count+1;
ENDLOOP;
IF curLength > maxLength THEN maxLength _ curLength;
in.SetIndex[pos];
RETURN [maxLength <= alreadyFoldedLength]; };
CopyFolded: PROC [in, out: IO.STREAM, breakRope: Rope.ROPE _ NIL, lineLength: INT _ foldLength, initialLength: INT _ 0] = {
currentLength: INT _ initialLength;
breakLength: INT _ breakRope.Length[];
whiteSpace, blackSpace: Rope.ROPE;

WhiteSpaceProc: Lex822.CharProc = {
SELECT char FROM
Ascii.SP, Ascii.TAB, Ascii.LF => RETURN [FALSE, TRUE];
MTTreeOps.discretionaryBlank => RETURN [FALSE, FALSE]
ENDCASE => RETURN [TRUE, FALSE]; };

BlackSpaceProc: Lex822.CharProc = {
SELECT char FROM
Ascii.SP, Ascii.TAB, Ascii.LF, Ascii.CR, MTTreeOps.discretionaryBlank =>
RETURN [TRUE, FALSE];
ENDCASE => RETURN [FALSE, TRUE]; };

DO
ENABLE IO.EndOfStream => EXIT;
IF in.PeekChar[] = Ascii.CR THEN {
out.PutChar[in.GetChar[]];
[] _ in.PeekChar[];  -- Careful!  Don't output the breakRope if we're out of input.
IF breakLength > 0 THEN
out.PutRope[breakRope];
currentLength _ breakLength;
};
whiteSpace _ Lex822.GetSequence[in, WhiteSpaceProc];
blackSpace _ Lex822.GetSequence[in, BlackSpaceProc];
IF currentLength+whiteSpace.Length[]+blackSpace.Length[] > lineLength THEN {
IF blackSpace.Length[] > 0 THEN {
out.PutChar['\n];
IF breakLength > 0 THEN
out.PutRope[breakRope];
out.PutRope[blackSpace];
currentLength _ breakLength+blackSpace.Length[];
};
}
ELSE {
out.PutRope[whiteSpace];
out.PutRope[blackSpace];
currentLength _ currentLength+whiteSpace.Length[]+blackSpace.Length[];
};
ENDLOOP;
};
CopyNormal: PROC [in, out: IO.STREAM] ~ {
buffer: REF TEXT = RefText.ObtainScratch[512];
DO
IF in.GetBlock[buffer]=0 THEN EXIT;
out.PutBlock[buffer];
ENDLOOP;
RefText.ReleaseScratch[buffer]; };
SetDefaultDomain: PROC [info: Info] = {
hl: LIST OF REF ANY _ info.headers;
fromDomainType, senderDomainType: MTTreeOps.DomainType _ unknown;
fromDomain, senderDomain: REF ANY _ NIL;

WHILE hl # NIL DO
hr: REF HeaderRec _ NARROW[hl.first];
IF hr.fieldType = nameField THEN {
IF Rope.Equal[hr.name, "sender", FALSE] THEN
[senderDomainType, senderDomain] _ MTTreeOps.DefaultDomain[hr.body]
ELSE IF Rope.Equal[hr.name, "from", FALSE] THEN
[fromDomainType, fromDomain] _ MTTreeOps.DefaultDomain[hr.body] };
hl _ hl.rest;
ENDLOOP;
SELECT TRUE FROM
senderDomainType # unknown => {
info.defaultDomainType _ senderDomainType;
info.defaultDomain _ senderDomain; };
fromDomainType # unknown => {
info.defaultDomainType _ fromDomainType;
info.defaultDomain _ fromDomain;}
ENDCASE => {
info.defaultDomainType _ unknown;
info.defaultDomain _ NIL; }; };
ParseHeaders: PUBLIC ENTRY PROC [file, errStream: IO.STREAM] RETURNS [info: Info] = {
headerName, token, whiteSpace, token2: Rope.ROPE;
headerNameOk: BOOL;

Error: PROC [errorMsg: Rope.ROPE] = {
errStream.PutF["Error in parse of %g: %g.\n", IO.rope[headerName], IO.rope[errorMsg]]; };

ParseField: PROC [hr: REF HeaderRec, Input: P1.ScannerProc, what: Rope.ROPE] RETURNS[error: BOOL _ FALSE]~ {
streamIndex: INT _ file.GetIndex[];
badSemantics: BOOL _ FALSE;
nTokens, nErrors: INT;
[nErrors: nErrors, nTokens: nTokens] _ P1.Parse[file, Input];
IF nErrors = 0 THEN
[hr.body, badSemantics] _ P1.GetEvalResult[];
IF nErrors > 0 OR badSemantics THEN {
Error[Rope.Cat["incorrect ", what]];
error _ TRUE;
hr.fieldType _ textField;
file.SetIndex[streamIndex];
hr.body _ Lex822.LexText[file]; }; };

info _ NEW[InfoRec];
info.headers _ NIL;
info.foldLines _ TRUE;
DO
hr: REF HeaderRec;
[headerName, headerNameOk] _ Lex822.LexFieldName[file];
IF headerNameOk AND headerName.IsEmpty[] THEN EXIT;
IF headerNameOk THEN [token, whiteSpace, ] _ Lex822.LexToken[file]
ELSE { token _ whiteSpace _ NIL; Error["Illegal field name"]; };
IF ~headerNameOk OR ~token.Equal[":"] THEN {
IF headerNameOk THEN Error["Field name not followed by colon"];
token2 _ Lex822.LexText[file];
hr _ NEW[HeaderRec _ [
name: NIL,  -- Empty name field means don't use colon to print it.
fieldType: textField,
body: Rope.Cat[headerName, whiteSpace, token, token2]]]; }
ELSE {
hr _ NEW[HeaderRec _ [name~headerName, fieldType~TRASH]];
SELECT TRUE FROM
headerName.Equal["date", FALSE] => {
hr.fieldType _ dateField;
[] _ ParseField[hr, P1.ScanDate, "date field"] };
headerName.Equal["cc", FALSE] => {
ccRope: Rope.ROPE;
error: BOOL _ FALSE;
hr.fieldType _ nameField;
error _ ParseField[hr, P1.ScanName, "name list"];
IF hr = NIL THEN LOOP;
IF hr.body = NIL THEN LOOP;
IF ~error THEN {
ccRope _ MTTreeOps.TreeToSimpleRope[hr.body];
IF ccRope = NIL THEN LOOP;  
IF Rope.Equal[ccRope, "\n"] THEN LOOP;  -- cc fields are not allowed to be empty
};
};
IsNameFieldHeader[headerName] => {
hr.fieldType _ nameField;
[] _ ParseField[hr, P1.ScanName, "name list"] };
ENDCASE => {
r: Rope.ROPE _ Lex822.LexText[file];
hr.fieldType _ textField;
hr.body _ r;
IF hr.name.Equal[lineFold, FALSE] AND r.Find[s2: "no", case: FALSE]>=0 THEN
info.foldLines _ FALSE; }; };
IF hr # NIL THEN info.headers _ List.Nconc1[info.headers, hr];
ENDLOOP;
SetDefaultDomain[info]; };
PrintHeaders: PUBLIC PROC [info: Info, out: IO.STREAM, fold: BOOL _ FALSE] = {
hl: LIST OF REF ANY _ info.headers;
WHILE hl # NIL DO
hr: REF HeaderRec _ NARROW[hl.first];
body: Rope.ROPE;
spareStream: IO.STREAM;
IF ~hr.name.IsEmpty[] THEN
out.Put[IO.rope[hr.name], IO.rope[":"]];
IF hr.fieldType = nameField OR hr.fieldType = dateField THEN
body _ MTTreeOps.TreeToRope[tree: hr.body, insertDiscretionaryBlanks: fold]
ELSE body _ NARROW[hr.body];
IF fold THEN {
spareStream _ IO.RIS[body, spareStream];
CopyFolded[in: spareStream, out: out, breakRope: " ", initialLength: hr.name.Length+1]; }
ELSE out.PutRope[body];
hl _ hl.rest;
ENDLOOP; };
xeroxDomain: REF ANY = MTTreeOps.XeroxDomain[];
TranslateToArpa: PUBLIC PROC [info: Info] = {
hl: LIST OF REF ANY _ info.headers;
msgId: BOOL _ FALSE;
FOR hl: LIST OF REF ANY _ info.headers, hl.rest UNTIL hl = NIL DO
hr: REF HeaderRec _ NARROW[hl.first];
IF Rope.Equal[hr.name, msgID, FALSE] THEN msgId _ TRUE;
IF hr.fieldType = nameField THEN
IF info.defaultDomainType = registry THEN
hr.body _ MTTreeOps.ToArpa[hr.body, info.defaultDomainType, info.defaultDomain]
ELSE
hr.body _ MTTreeOps.ToArpa[hr.body, arpaDomain, xeroxDomain];
ENDLOOP;
IF ~msgId AND info.id # NIL THEN {
hr: REF HeaderRec _ NEW[HeaderRec];
hr^ _ [
name: msgID,
fieldType: textField,
body: IO.PutFR[" <%G@%G>\n", [rope[info.id]], [rope["Xerox"]]] ];
info.headers _ List.Nconc1[info.headers, hr]; }; };
TranslateToGrapevine: PUBLIC PROC [info: Info] = {
hl: LIST OF REF ANY _ info.headers;
WHILE hl # NIL DO
hr: REF HeaderRec _ NARROW[hl.first];
IF hr.fieldType = nameField THEN
hr.body _ MTTreeOps.ToGrapevine[hr.body, info.defaultDomainType, info.defaultDomain];
hl _ hl.rest;
ENDLOOP; };
TranslateMessage: PUBLIC PROC [in, out, error: IO.STREAM, direction: MT.Direction, id: ROPE] = {
info: Info _ ParseHeaders[in, error];
fold: BOOL;
info.id _ id;
IF direction = toArpa THEN TranslateToArpa[info] ELSE TranslateToGrapevine[info];
PrintHeaders[info, out, direction = toArpa];
fold _ direction = toArpa AND info.foldLines AND ~AlreadyFolded[in];
IF fold THEN CopyFolded[in, out] ELSE CopyNormal[in, out]; };
CheckFromField: PUBLIC PROC [info: Info] RETURNS [ok: BOOL _ TRUE] = {
fromFound: BOOL _ FALSE;
FOR hl: LIST OF REF ANY _ info.headers, hl.rest UNTIL hl = NIL DO
hr: REF HeaderRec _ NARROW[hl.first];
IF hr.fieldType = nameField AND (Rope.Equal[hr.name, "From", FALSE] OR Rope.Equal[hr.name, "Sender", FALSE]) THEN {
rope: Rope.ROPE _ MTTreeOps.TreeToSimpleRope[hr.body];
IF FunnyCharacters[rope] THEN ok _ FALSE;
IF Rope.Equal[hr.name, "From", FALSE] THEN fromFound _ TRUE; }
ENDLOOP;
IF ~fromFound THEN ok _ FALSE; };
FunnyCharacters: PROC [rope: Rope.ROPE] RETURNS [funny: BOOL] =
BEGIN
length: INT _ Rope.Length[rope];
IF length = 0 THEN RETURN[TRUE];
FOR i: INT IN [0..length) DO
SELECT Rope.Fetch[rope, i] FROM
> 177C => EXIT; -- Funny characters. What should happen to these??
'@, ',  => NULL; -- @, and comma
'(, '), '<, '>, '<  => NULL;
';, '\\, '", '[, ']  => NULL; -- Rest of Specials EXCEPT PERIOD!
': => EXIT; --  Stop NS names from going through
'  => NULL; -- Space 
'\n => IF i # length-1 THEN EXIT; -- Trailing CR is OK
< 040C => EXIT; -- CTL
ENDCASE => NULL; -- Includes underbar
REPEAT FINISHED => RETURN[FALSE]; -- Nothing fancy inside the string
ENDLOOP;
RETURN[TRUE];
END;

InitParser[];
END.
¨MTMain.mesa
Hal Murray May 27, 1985 8:06:02 pm PDT
Last Edited by: HGM, April 20, 1985 10:12:40 pm PST
Last Edited by: Nichols, July 19, 1983 1:54 pm
Last Edited by: Taft, February 5, 1984 1:13:05 pm PST
Sharon Johnson, July 27, 1987 2:19:31 pm PDT
John Larson, July 27, 1987 6:29:59 pm PDT
This table holds the names of headers in a message that should be parsed as name fields.
Other interesting header filed names.
The variable that holds the parsed header and its type.
Line folding stuff.

Initializes the parser for parsing name fields.
Returns TRUE if fieldName is in nameFields, the list of headers that contain names.
Look at the first part of in and decide if it's already folded.
Fold the the text from in appending the breakRope to the newline that is used to break.  lineLength controls how long the lines are, and initialLength tells how much text is on the current line when CopyFolded is first called.
else we must be at EOF or a newline and we might as well just discard the whiteSpace.
Copy in to out.
Everything's wonderful, handle this header.
Is this test too slow?
Print the list of headers that ParseHeaders produced.  This can also be called after calling TranslateToArpa or TranslateToGrapevine.
Msg from ARPA land gets redistributed to ARPA via a GV DL.
Info extracted from From/Sender field is bogus.
Translate a message present on in to out printing error messages on error.
See MaybeAddQuotes in SMTPSyntaxImpl

ΚS˜
headš
Ϫ
code™&Jš
œ3™3Jš
œ.™.Jš
œ5™5—L™,L™)
code2š
Οk	˜	Mšœœœœœœ˜Mšœ
œkœœ˜
Mšœœ
˜Mšœœ!˜.Mšœœ,œ˜<Mšœœ˜M˜Mšœœ:˜FMšœ
œ˜Mšœ
œ˜ MšœœL˜VM˜Mšœœ
œq˜†
——šœœ
œ
Οc!˜7š
˜Mšœ8˜:Mš
œ˜—Mšœ
œ˜Mšœ
œ
˜Mšœœœ
˜™XM˜Mšœœί
˜—™%Mšœœ˜Mšœ
œ˜—™7M˜šœœœ
˜Mšœœ
˜Mš
œ-˜-Mšœœ
œžD˜V—Mšœœœ	˜šœ	œ
œœ˜Mšœœœ
˜Mšœœž1˜BMšœ)ž"˜KMšœœ
œ
˜Mš
œ	œ
œ
œ
œž8˜T——™M™Mšœœž!˜<Mšœœ	ž3˜TMšœœ
ž/˜T—šΟn
œœœ˜M™/Mšœœœ˜Q—š
Ÿœœœœœ˜AM™SMšœ+˜1M˜—šŸ
œœœ
œœœ˜@M™?Mšœœ˜Mšœœ˜Mšœœ˜šœ œ
˜7šœœ
œ˜!Mšœœ˜4M˜—Mšœ˜M˜Mšœ
˜—Mšœœ˜4M˜Mšœ'˜-—šŸ
œœœ
œœœœœ	˜{MšœΟrœ 	œ( 
œ& 
œ1 
œ™β
Mšœœ˜#Mšœ
œ˜&Mšœœ
˜"M˜š
œ#˜#šœ˜Mš
œœœœœœœ˜6Mšœ œœœ
˜5Mšœœœœ˜#—M˜—š
œ#˜#šœ˜š	œœœœœ!˜HMšœœœ˜—Mšœœœœ˜#—M˜—š
˜Mšœ
œœ
˜šœœ
œ˜"M˜Mšœž>˜Sšœ˜M˜—M˜M˜—M˜4M˜4šœDœ˜Lšœœ˜!M˜šœ˜M˜—M˜M˜0M˜—M™UM˜
—šœ˜M˜M˜M˜FM˜—Mšœ
˜—M˜—šŸ
œœœ
œ˜)M™Mšœœ
œ˜.š
˜Mšœœ
œ
˜#M˜Mšœ
˜—M˜"—šŸœœ˜'Mš	œœ
œ
œ
œ˜#M˜AMšœœ
œœ
˜(M˜šœœ
˜Mšœœ
œ˜%šœœ˜"šœœ˜,M˜C—šœ
œœ˜/M˜B——M˜
Mšœ
˜—šœ
œ
˜š
œ˜M˜*M˜%—š
œ˜M˜(M˜!—šœ˜M˜!Mšœœ˜———šŸœœ
œ
œœ
œœ˜UMšœ,œ
˜1Mšœœ
˜M˜šŸœœœ˜%Mšœ.œœ˜YM˜—šŸ
œœœŸœœœœœœ˜lMšœ
œ˜#Mšœœœ
˜Mšœœ
˜Mšœ'œ˜=šœ
˜Mšœœ˜-—šœ
œœ˜%M˜$Mšœœ
˜
M˜Mš
œ˜M˜%——M˜Mšœœ
˜Mšœœ
˜Mšœœ
˜š
˜Mšœœ˜Mš
œ7˜7Mšœœœ
œ
˜3Mšœœ.˜BMšœœ!˜@šœœœ˜,Mšœœ+˜?M˜šœœ˜Mšœœž6˜BMš
œ˜Mš
œ:˜:——šœ˜M™+Mšœœ)œ˜9šœ
œ
˜šœœ˜$Mš
œ˜M˜1—šœœ˜"Mšœ
œ
˜Mšœœœ
˜Mš
œ˜Mš
œ1˜1Mšœœ
œ
œ
˜Mšœœ
œ
œ
˜šœœ˜Mš
œ-˜-Mšœ
œ
œ
œ˜Mšœœ
œž(˜PM˜—M˜—š
œ"˜"Mš
œ˜M˜0—šœ˜Mšœœ˜$Mš
œ˜M˜M™š	œœœœ˜KMšœœ˜————Mšœœ
œ.˜>Mšœ
˜—M˜—šŸœœ
œœ
œœœ˜NMšœŸœ2ŸœŸœ
™…
Mš	œœ
œ
œ
œ˜#šœœ
˜Mšœœ
œ˜%Mšœœ
˜Mšœ
œ
œ
˜šœ˜Mšœœœ˜(—šœœ˜<Mš
œK˜K—Mšœœ
˜šœœ˜Mšœœ
œ˜(Mš
œY˜Y—Mšœ˜M˜
Mšœ˜———šœ
œ
œ˜/šŸœœ
œ˜-Mš	œœ
œ
œ
œ˜#Mšœœœ
˜šœœ
œ
œ
œœœ
˜AMšœœ
œ˜%Mšœœœ	œ
˜7šœ˜ šœ#˜)Mš
œO˜O—š
˜Mš	œ	œœœ
œ
™:M™/Mš
œ=˜=——Mšœ
˜—šœœœ
œ˜"Mšœœ
œ˜#š
œ˜Mš
œ˜Mš
œ˜Mšœœ9˜A—Mš
œ3˜3——šŸœœ
œ˜2Mš	œœ
œ
œ
œ˜#šœœ
˜Mšœœ
œ˜%šœ˜ M˜U—M˜
Mšœ˜——šŸœœ
œœ
œ
œœ˜`Mšœ œ œ œ
™JM˜%Mšœœ
˜M˜
Mšœœœ˜QMš
œ,˜,Mšœœœ˜DMšœœœ˜=—šŸœœ
œœœœ˜FMšœœœ
˜šœœ
œ
œ
œœœ
˜AMšœœ
œ˜%šœœœœœœ˜sMšœœ'˜6Mšœœœ
˜)Mšœœœ
œ˜>—Mšœ
˜—Mšœœœ˜!—š
Ÿœœ
œœ	œ˜?Mš
˜M™$Mšœœ˜ Mšœœ
œ
œ˜ šœœ
œ
˜šœ˜Mšœ
œ
ž2˜BMšœœ
ž˜ Mšœœ
˜Mšœœ
ž"˜@Mšœœ
ž$˜0Mšœœ
ž	˜M™Mšœœœ
œ
ž˜6Mšœ
œ
ž˜Mšœœž˜%—Mš	œ
œœ
œž"˜DMšœ
˜—Mšœ
œ˜
Mšœ
˜M˜—M˜
Mšœ
˜——…—*T>O