initial import from eudora.com

.gitignore

@@ -0,0 +1,5 @@
+.AppleDouble
+.DS_Store
+*.swp
+~$*
+._*

AddressBookTabs/notesTab.r

@@ -0,0 +1 @@
+#include "EudoraTypes.r"
#include "::tabmania.r"

resource 'eTAB' (132, "Notes Tab", purgeable) {
	'CSOm',
	'Nick',
	'Note',
	"Notes",
	0,
	12,
	12,
	{
			// Object 0
			fieldObject {
					objectFlagAcceptsFocus | objectFlagExportable,
					"note",																											// tag
					"",																													// label
					"Notes:",																										// Field name
					0,																													// label height (and we don't care)
					labelFlushDefault, 																					// label justification
					labelAutoSizeFieldHeight | labelWrapField,									// label field flags
					peNoStyledPaste | peVScroll,																// PETE flags for the field
					{
							left   {  0, tabObject, relToLeft,	 rfDefaultMargin					},		// left coordinate
							top    {  0, tabObject, relToTop,		 rfDefaultMargin					},		// top coordinate
							right  {  0, tabObject, relToRight,	 rfNegativeDefaultMargin	},		// right coordinate
							bottom {  0, tabObject, relToBottom, rfNegativeDefaultMargin	}			// bottom coordinate
					}
			}
	}
};

AddressBookTabs/otherTab.r

@@ -0,0 +1 @@
+#include "EudoraTypes.r"
#include "::tabmania.r"

resource 'eTAB' (131, "Other Tab", purgeable) {
	'CSOm',
	'Nick',
	'Othr',
	"Other",
	0,
	12,
	12,
	{
			// Object 0  (note that 33% of the tab height results in a "short" final field.  If should be 33% of tab height - defaultMargin
			// 						but there's not yet a way to express this.  Or, we say that this is item 1 of 3 and the math is taken
			//						care of for us)
			fieldObject {
					objectFlagAcceptsFocus | objectFlagExportable,
					"otheremail",																								// tag
					"Other Email Addresses:",																		// label
					"Other Email:",																							// Field name
					0,																													// label height (and we don't care)
					labelFlushLeft, 																						// label justification
					labelDisplayAboveField | labelAutoSizeFieldHeight | labelWrapField,					// label field flags
					peNoStyledPaste,																						// PETE flags for the field
					{
							left   {  0, tabObject, relToLeft,	 rfDefaultMargin					},		// left coordinate
							top    {  0, tabObject, relToTop,		 rfDefaultMargin					},		// top coordinate
							right  {  0, tabObject, relToRight,	 rfNegativeDefaultMargin	},		// right coordinate
							bottom { 33, tabObject, relToHeight, rfNone										}			// bottom coordinate
					}
			};

			// Object 1
			fieldObject {
					objectFlagAcceptsFocus | objectFlagExportable,
					"otherphone",																					// tag
					"Other Phone Numbers:",																// label
					"Other Phone:",																				// Field name
					0,																													// label height (and we don't care)
					labelFlushLeft, 																						// label justification
					labelDisplayAboveField | labelAutoSizeFieldHeight | labelWrapField,					// label field flags
					peNoStyledPaste,																						// PETE flags for the field
					{
							left   {  0, 0, relToLeft,	 			rfNone					},		// left coordinate
							top    {  0, 0, relToBottom,			rfDefaultMargin					},		// top coordinate
							right  {  0, 0, relToRight,	 			rfNone	},		// right coordinate
							bottom { 66, tabObject, relToHeight, rfNone							}			// bottom coordinate
					}
			};

			// Object 2
			fieldObject {
					objectFlagAcceptsFocus | objectFlagExportable,
					"otherweb",																									// tag
					"Other Web Pages:",																					// label
					"Other Web:",																								// Field name
					0,																													// label height (and we don't care)
					labelFlushLeft, 																						// label justification
					labelDisplayAboveField | labelAutoSizeFieldHeight | labelWrapField,					// label field flags
					peNoStyledPaste,																						// PETE flags for the field
					{
							left   {  0, 1, relToLeft,	 			rfNone					},		// left coordinate
							top    {  0, 1, relToBottom,			rfDefaultMargin					},		// top coordinate
							right  {  0, 1, relToRight,	 			rfNone	},		// right coordinate
							bottom {  0, tabObject, relToBottom, rfNegativeDefaultMargin										}			// bottom coordinate
					}
			}
	}
};

AddressBookTabs/personalTab.r

@@ -0,0 +1 @@
+#include "EudoraTypes.r"
#include "::tabmania.r"

resource 'eTAB' (128, "Personal Tab", purgeable) {
	'CSOm',
	'Nick',
	'Pers',							// Personal
	"Personal",
	0,
	12,
	12,
	{
			// Object 0
			fieldObject {
					objectFlagAcceptsFocus | objectFlagExportable,
					"name",																	// tag
					"Full Name:",														// label
					"Name:",																// Field name
					0,																			// label width
					labelFlushLeft, 												// label justification
					labelAutoSize,													// label field flags
					peNoStyledPaste | peClearAllReturns,		// PETE flags for the field
					{
							left   {  24, tabObject, relToLeft,  rfNone   },		// left coordinate
							top    {  18, tabObject, relToTop,	 rfNone    },		// top coordinate
							right  { -24, tabObject, relToRight, rfNone  },			// right coordinate
							height { kUseOneLineHeight }
					}
			};

			// Object 1
			fieldObject {
					objectFlagAcceptsFocus | objectFlagExportable,
					"first",																// tag
					"First Name:",													// label
					"First:",																// Field name
					kUseOneLineHeight,											// label width (indicating the height of the PETE)
					labelFlushLeft, 												// label justification
					labelDisplayAboveField,									// label field flags
					peNoStyledPaste | peClearAllReturns,		// PETE flags for the field
					{
							left   {   0, tabObject, relToLeft,				rfDefaultMargin	},		// left coordinate
							top    {   0, 0,				 relToBottom,			rfDefaultMargin	},		// top coordinate
							right  { -22, tabObject, relToHorzCenter, rfNone					},		// right coordinate
							height { kUseOneLineHeight }
					}
			};

			// Object 2
			fieldObject {
					objectFlagAcceptsFocus | objectFlagExportable,
					"last",																	// tag
					"Last Name:",														// label
					"Last:",																// Field name
					kUseOneLineHeight,											// label width (indicating the height of the PETE)
					labelFlushLeft, 												// label justification
					labelDisplayAboveField,									// label field flags
					peNoStyledPaste | peClearAllReturns,		// PETE flags for the field
					{
							left   { 22, tabObject, relToHorzCenter, rfNone										},		// left coordinate
							top    {  0, 0,					relToBottom,		 rfDefaultMargin					},		// top coordinate
							right  {  0, tabObject, relToRight,			 rfNegativeDefaultMargin	},		// right coordinate
							height { kUseOneLineHeight }
					}
			};

			// Object 3
			controlResourceObject {
					objectFlagNone,
					"",																				// no tag
					"",																				// Field name
					1163,																			// 'CNTL' resource
					swapFirstLastBehavior,										// Swap a couple of fields on this tab
					"first",
					"last",
					{
								horizontal	{ alignCenter, tabObject, rfNone },
								vertical		{ alignCenter, 1,					rfPETEPart }
					}
			};

			// Object 5
			fieldObject {
					objectFlagAcceptsFocus | objectFlagExportable,
					"email",																										// tag
					"This nickname will expand to the following address(es):",	// label
					"Address(es):",																							// Field name
					0,																													// label height (and we don't care)
					labelFlushLeft, 																						// label justification
					labelDisplayAboveField | labelAutoSizeFieldHeight | labelWrapField,					// label field flags
					peVScroll | peNoStyledPaste,																								// PETE flags for the field
					{
							left   {  0, tabObject, relToLeft,	 rfDefaultMargin					},		// left coordinate
							top    {  0, 1,					relToBottom, rfDefaultMargin					},		// top coordinate
							right  {  0, tabObject, relToRight,	 rfNegativeDefaultMargin	},		// right coordinate
							bottom {  0, tabObject, relToBottom, rfNegativeDefaultMargin	}			// bottom coordinate
					}
			}
	}
};

AddressBookTabs/photoTab.r

@@ -0,0 +1 @@
+#include "Types.r"
#include "Controls.r"
#include "::include:EudoraTypes.r"
#include "::tabmania.r"

resource 'eTAB' (133, purgeable) {
	'CSOm',
	'Nick',
	'Phot',
	"Photo",
	0,
	12,
	12,
	{
			// Object 0
			controlObject {
					objectFlagNone,
					"",
					"Select PhotoÉ",
					"",
					0, 0, 1, kControlPushButtonProc, 0, coFit, behaveNavigation, "picture", "",		// Display a Nav Services Dialog and pass the FSSpecPtr to the 'picture' object
					{
							horizontal	{ alignCenter, tabObject, rfNone },
							bottom 			{ 0, tabObject, relToBottom, rfNegativeDefaultMargin }
					}
			};
			
			// Object 0
			pictureObject {
					objectFlagAcceptsFocus | objectFlagExportable,
					"picture",																									// tag
					"",																													// Field name
					'PICT',																											// Drag flavor we'll accept
					{
							left   {  0, tabObject, relToLeft,	 rfDefaultMargin					},		// left coordinate
							top    {  0, tabObject, relToTop,		 rfDefaultMargin					},		// top coordinate
							right  {  0, tabObject, relToRight,	 rfNegativeDefaultMargin	},		// right coordinate
							bottom {  0, 0, relToTop, rfNegativeDefaultMargin	}																				// bottom coordinate
					}
			};
	}
};

Bits/AddDlgx

@@ -0,0 +1 @@
+# creates dlgx and alrx resources from a file containing derezed DLOGs and ALRTs
# this file will probably have to change as the Appearance.r files change

$dlgxHierString = ") {\n\tversionZero {\n\tkDialogFlagsUseThemeBackground + kDialogFlagsUseThemeControls + kDialogFlagsUseControlHierarchy\n\t}\n};\n";
$dlgxNormString = ") {\n\tversionZero {\n\tkDialogFlagsUseThemeBackground + kDialogFlagsUseThemeControls\n\t}\n};\n";
$alrxString = ") {\n\tversionOne {\n\t0x09, 0, kUseThemeWindow, \"\"\n\t}\n};\n";

$dlist = '1002, ';
$alist = '1002, ';
$hlist = '1005, 1034, 1064, 1068, 1075, 1078, 1079, 1080, 1081, 1082, 1083, 1084, 1085, 1086, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1098, 1099, 1100, 1101, 1103, 1104, 2000, ';

while (<>)
{
	@line = split(/^/);
	foreach (@line)
	{
		s/data/resource/;
		@word = split(" ",$_,4);
		$word[2] =~ s/\(//;
		if ($_ =~ /DLOG/ && ($dlist !~ $word[2]))
		{
			$dlist .= "$word[2] ";
			s/DLOG/dlgx/;
			if ($hlist =~ $word[2])
			{
				s/\,.*/$dlgxHierString/;
			}
			else
			{
				s/\,.*/$dlgxNormString/;
			}
			print;
		}
		elsif ($_ =~ /ALRT/ && ($alist !~ $word[2]))
		{
			$alist .= "$word[2] ";
			s/ALRT/alrx/;			
			s/\,.*/$alrxString/;
			print;
		}
	}
}

Bits/ProcessDlogHelp

@@ -0,0 +1 @@
+perl -x "{0}" {"parameters"} ; exit
#!/usr/local/bin/perl
open(SRC,"<$ARGV[0]") || die;
open(HFIL,">$ARGV[0].hdlg") || die;
open(SFIL,">$ARGV[0].strn") || die;
open(EFIL,"<$ARGV[0].extras") || die;
$str=$ARGV[1];
$gran=90;
$elem=$gran+1;

#
# read extras
#
while (<EFIL>)
{
  if (/^#/ || /^\W*$/) {next;}
  chop;
  ($cmd,$rest) = split(/\t/,$_,2);
  if ($cmd eq "DLOG")
  {
    ($id) = split(/\t/,$rest);
		$l = 0;
  }
  else
	{
		$l++;
		$Extras{"d$id"."l$l"} = $_;
	}
}


$id = 0;
while (<SRC>)
{
  if (/^#/ || /^\W*$/) {next;}
  chop;
	$l++;
  ($cmd,$rest) = split(/\t/,$_,2);
  if ($cmd eq "DLOG")
  {
    if ($id != 0) {print HFIL "}};\n";}
    ($id,$nSkip) = split(/\t/,$rest,2);
    if ($nSkip eq "") {$nSkip = "0";}
    print HFIL "resource 'hdlg' ($id,purgeable) { HelpMgrVersion,$nSkip,hmDefaultOptions,0,3,\n";
    $notfirst = 0;
		$l = 0;
  }
  else
	{
		if ($Extras{"d$id"."l$l"} ne "")
		{
			$_ = $Extras{"d$id"."l$l"};
			($cmd,$rest) = split(/\t/,$_,2);
		}
		if ($cmd eq "SKIP")
		{
			print HFIL "HMSkipItem {},\n";
			if ($notfirst == 0)
			{
				print HFIL "{\n";
				$notfirst = 1;
			}
		}
  	else
		{
			print HFIL "HMStringResItem {{5,5},{0,0,0,0},\n";
			@strings = split('##',$rest);
			$rep = $strings[0];
			for ($i=0;$i<=$#strings;$i++)
			{
				if ($strings[$i] eq "")
				{
					print HFIL "0,0,\n";
				}
				else
				{
					if ($elem>=$gran)
					{
						if ($elem==$gran) {print SFIL '}};' . "\n";}
						$elem = 0;
						$str += 100;
						printf SFIL "resource 'STR#' (%d,purgeable) {{\n",$str;
					}
					printf HFIL "%d,%d,\n",$str,++$elem;
					$toprint = $strings[$i];
					($rp,$rest) = split(' ',$toprint,2);
					if ($rp eq "REPEAT") {$toprint = $rep; if ($rest ne "") {$toprint .= "\\n" . $rest;}}
					print SFIL "\"$toprint\",\n";
				}
			}
			for (;$i<4;$i++)
			{
				print HFIL "0,0,\n";
			}
			print HFIL "},\n";
			if ($notfirst == 0)
			{
				print HFIL "{\n";
				$notfirst = 1;
			}
		}
	}
}

if ($elem>0 && $elem<=$gran) {print SFIL '}};' . "\n";}
if ($id != 0) {print HFIL "}};\n";}

Bits/ProcessMenuHelp

@@ -0,0 +1 @@
+perl -x "{0}" {"parameters"} ; exit
#!/usr/local/bin/perl
open(SRC,"<$ARGV[0]") || die;
open(HFIL,">$ARGV[0].hmnu") || die;
open(EFIL,"<$ARGV[0].extras") || die;
$str=$ARGV[1];
$gran=40;
$elem=$gran+1;


#
# read extras
#
while (<EFIL>)
{
  if (/^#/ || /^\W*$/) {next;}
  chop;
  ($cmd,$rest) = split(/\t/,$_,2);
  if ($cmd eq "MENU")
  {
    $id = $rest;
		$l = 0;
  }
  else
	{
		$l++;
		$Extras{"d$id"."l$l"} = $_;
	}
}


$id = 0;
while (<SRC>)
{
  if (/^\W*$/) {next;}
	if (/^#/) {print HFIL;next;}
  chop;
	$l++;
  ($cmd,$rest) = split(/\t/,$_,2);
  if ($cmd eq "MENU")
  {
    if ($id != 0) {print HFIL "}};\n";}
    $id = $rest;
    print HFIL "resource 'hmnu' ($rest,purgeable) { HelpMgrVersion,0,0,0,\n";
    $notfirst = 0;
		$l = 0;
  }
  elsif ($cmd eq "SKIP")
  {
    print HFIL "HMSkipItem {},\n";
    if ($notfirst == 0)
    {
      print HFIL "{\n";
      $notfirst = 1;
    }
  }
  else
  {
		if ($Extras{"d$id"."l$l"} ne "")
		{
			$_ = $Extras{"d$id"."l$l"};
			($cmd,$rest) = split(/\t/,$_,2);
		}
    print HFIL "HMStringItem {\n";
    @strings = split('##',$rest);
    $rep = $strings[0];
    for ($i=0;$i<=$#strings;$i++)
    {
			$toprint = $strings[$i];
			($rp,$rest) = split(' ',$toprint,2);
			if ($rp eq "REPEAT") {$toprint = $rep; if ($rest ne "") {$toprint .= "\\n" . $rest;}}
      print HFIL qq/"$toprint",\n/;
    }
    for (;$i<4;$i++)
    {
      print HFIL qq/"",\n/;
    }
    print HFIL "},\n";
    if ($notfirst == 0)
    {
      print HFIL "{\n";
      $notfirst = 1;
    }
  }
}
if ($id != 0) {print HFIL "}};\n";}

Bits/ProcessStrRes

@@ -0,0 +1 @@
+open(REZ,">$ARGV[0].strn") || die "$rez";
open(H,">:include:$ARGV[0].h") || die "$h";
open(DOC,">$ARGV[0].doc") || die "$doc";

print H "#ifndef STRNDEFS_H\n#define STRNDEFS_H\n\n";
while (<>)
{
	if (/^#/) {print REZ; print H; next;}
	chop;
	if (/^$/) {next;}
	if (/^R\t/)
	{
		if ($resName ne "") {&finish;}
		($r,$resName,$id,$comment) = split("\t");
		#
		# resource declaration
		#
		print REZ "resource 'STR#' ($id,purgeable) {{\n";
		#
		# include file
		#
		print H "#define $resName"."Strn $id\n";
		print H "typedef enum {\n";
		#
		# doc file
		#
		if ($comment ne "") {print DOC "$id - $comment\n";}
		#
		# we've got a definition going
		#
		$num = 1;
	}
	else
	{
		($name,$value,$comment) = split("\t");
		#
		# resource declaration
		#
		print REZ qq?\t"$value",\n?;
		#
		# include file
		#
		if ($name ne "")
		{
			print H "\t$name";
			if ($num==1) {print H "=1";}
			print H ",";
			if ($num>1) {print H " /*$num*/ ";}
			if ($comment ne "") {print H "/* $comment */";}
			print H "\n";
		}
		#
		# doc file
		#
		if ($comment ne "")
		{
			printf DOC "%5d - %s\n",$comment;
		}
		$num++;
	}
}
&finish;
print H "\n#endif\n";

sub finish
{
	print REZ "}};\n";
	print H "\t$resName"."Limit,\n\t$resName"."MakeLong=-1000000\n} $resName"."Enum;\n";
}

Bits/ProcessStrings

@@ -0,0 +1 @@
+Perl -x "{0}" {"parameters"} ; exit
#!/usr/local/bin/perl
open(DEFS,">:include:$ARGV[0].h") || die;
open(RFIL,">$ARGV[0].strn") || die;
open(DOC,">$ARGV[0]H.strn") || die;
open(ACAP,">$ARGV[0].acap") || die;
open(XSET,">$ARGV[0].xset") || die;
$str=5400;
$gran=20;
$elem=$gran+1;

print DEFS "#ifndef STRINGDEFS_H\n#define STRINGDEFS_H\n\n";

#print DOC "Type 'STH#' as 'STR#' ;\n";

while (<>)
{
	if (/^#/)
	{
		if ($elem && $elem<=$gran)
		{
			print RFIL '}};' . "\n";
			print DOC '}};' . "\n";
		}
		$elem=$gran+1;
		print RFIL;
		print DOC;
		print DEFS;
	}
	elsif (/^=/)
	{
		if ($elem && $elem<=$gran)
		{
			print RFIL '}};' . "\n";
			print DOC '}};' . "\n";
		}
		chop;
		split;
		$str = $_[1]-200;
		if ($str>32000) {$gran = 99;}
		$elem = $gran+1;
	}
	else
	{
		if ($elem>=$gran)
		{
			if ($elem && $elem<=$gran)
			{
				print RFIL '}};' . "\n";
				print DOC '}};' . "\n";
			}
			$elem = 0;
			$str += 200;
			printf RFIL "resource 'STR#' (%d,purgeable) {{\n",$str;
			printf DOC "resource 'STH#' (%d,purgeable) {{\n",$str;
		}
		chop;
		split(/\t/);
		($name,$acap,$func) = split('Ľ',$_[0]);
		printf DEFS "#define %s\t%d\t/*%s*/\t//%s\n",$name,$str + ++$elem,$_[1],$_[2];
		($help,$geek) = split('ŠŠ',$_[2]);
		print RFIL '  "' . $_[1] . '",' . "\n";
		print DOC '/*' . ($str+$elem) . '*/  "' . $help . '",' . "\n";
		if ($_[2] ne "" && !($_[2] =~ /don.t touch/i)) {print XSET '<x-eudora-setting:' . ($str+$elem) . "> $_[2]\n";}
		if ($acap ne "") {print ACAP ($str+$elem) . "\t$acap\t$func\n";}
		if ($geek ne "") {$geekList .= "resource 'GSTR' (" . ($str+$elem). ",purgeable) {\"$geek\"};\n";}
	}
}

if ($elem && $elem<=$gran)
{
	print RFIL '}};' . "\n";
	print DOC '}};' . "\n";
}

if ($geekList ne "") {print DOC $geekList;}

print DEFS "\n\n#endif\n";

Bits/buildCredits

@@ -0,0 +1 @@
+# creates PICT resource from a list of names

## Magic resource numbers - this is what Eudora expects.
$firstResNum = 1013;
$curResNum = 1013;

# Static stuff that is the same in each picture
$resHeader = "{ 0, 0, 177, 502},\n	VersionTwo {{ \
	HeaderOp { Version2, 0xFFFF0000, 0xFFFF0000, 0x1F60000, 0xB10000, 0 }, \
	DefHilite {},\n Clip {{ 0, 0, 177, 502 }, \$\"\" }, \
	RGBFgCol { 0, 0, 0, },\nPaintRect {{ 0, 0, 175, 500 }},\nPnSize {{ 0, 0 }}, \
	PaintRect {{ 19, 28, 163, 95 }},\nRGBFgCol { 65535, 65535, 65535, }, \
	FontName { 21, \"Helvetica\" },\nTxFont { 21 },\nTxMode { srcBic },\nTxSize { 9 },\n";

$resFooter = "OpEndPic {}}}};\n\n";

$nameCount = 0;

# OK, we want to put the names in colums. 
# Each column is 13 names long, and there are 5 columns in each picture.

print "#include \"Pict.r\"\n";

while (<>)
{
	chop;
	if (( $nameCount % 65 ) == 0 ) {
		print "resource 'PICT' ( ", $curResNum, ", \"Credits ", 2 + $curResNum - $firstResNum, "\", purgeable) {\n";
		print $resHeader;
		$curResNum++;
		}

	if ( $nameCount % 13 == 0 ) {	# Start a Column
		$newx = 25 + 95 * (( $nameCount % 65 ) / 13 );
		print "LongText {{ 25,", $newx, " }, \"", $_, "\\n\"},\n"
		}
	else {
		print "DVText { 11, \"", $_, "\\n\"},\n";
		}
	
	$nameCount++;

	if ( $nameCount % 65 == 0 ) {
		print $resFooter;
		}
}

# If we didn't finish a resource, close it off
if ( $nameCount % 65 != 0 ) {
	print $resFooter;
	}

Bits/buildacap

@@ -0,0 +1 @@
+open (RFILE,">acap.r") || die;

print RFILE <<'EOF';

#include ":include:acap.h"

resource 'EuAC' (128,purgeable)
{{
EOF

while (<>)
{
	chop;
	($id, $name, $type) = split;
	if ($type eq "") {$type = 0;}
	$nums[$#nums+1] = $id;
	print RFILE "\t$id,$type,0,\"vendor.Eudora.$name\",\n";
}

print RFILE <<'EOF';
}};

resource 'EuAl' (128,purgeable)
{{
EOF

foreach $num (sort{$a<=>$b}@nums)
{
	print RFILE "\t$num,\n";
}

print RFILE <<'EOF';
}};
EOF

Bits/buildaudit

@@ -0,0 +1 @@
+#
# boring setup
#
$hfile = ":include:auditdefs.h";
$rfile = "audit.r";
$cfile = "auditdefs.c";
$rid = 19600;

open(RFILE,">$rfile") || die;
open(HFILE,">$hfile") || die;
open(CFILE,">$cfile") || die;

#
# write initial junk
#
print RFILE <<'EOF';
resource 'STR#' (19600,purgeable) {{
EOF

print HFILE <<'EOF';
#ifndef AUDITDEFS_H
#define AUDITDEFS_H

EOF

print CFILE <<'EOF';
extern OSErr Audit(short auditType,...);
extern OSErr AuditFlush(Boolean force);

EOF

#
# finally, process the table
#
while(<>)
{
	if (/^#/) {next;}
	if (/^=/)
	{
		; # currently we don't do anything with the categories; they're just documentation for now
	}
	else
	{
		#
		# UINT4 crap...
		#
		s/UINT4/uLong/g;
		
		#
		# does this line want a flush?
		#
		if (s/^\+//) {$flush = "false";} # gentle flush
		elsif (s/^!//) {$flush = "true";} #hard flush
		else {$flush = "";}
		
		#
		# do basic split
		#
		chop;
		($name,$id,$cat,$fmt,$fnargs) = split(/\t/);
		if ($id > $maxID) {$maxID = $id;}
		
		#
		# write audit type to .h file, save prototype for later
		#
		print HFILE "#define kAudit$name $id //$cmnt\n";
		$proto .= "OSErr Audit$name($fnargs);\n";
		$cats .= "$cat,";
		
		#
		# remove type declarations from args
		#
		@fnargs = split(',',$fnargs);
		$auditArgs = "";
		foreach $fna (@fnargs)
		{
			$fna =~ s/ *$//;
			$fna =~ s/.* //;
			$auditArgs .= $fna . ',';
		}
		chop $auditArgs;	# remove trailing comma
		
		#
		# write function to .c file
		#
		if ($flush ne "")
		{
			print CFILE <<"EOF";

OSErr Audit$name($fnargs)
{
	OSErr err = Audit(kAudit$name,$auditArgs);
	if (!err) err = AuditFlush($flush);
	return err;
}
EOF
		}
		else
		{
			print CFILE <<"EOF";

OSErr Audit$name($fnargs)
{
	return Audit(kAudit$name,$auditArgs);
}
EOF
		}

		#
		# write format string to .r file
		#
		print RFILE qq|"$fmt\\n",\n|;
	}
}

#
# finish up
#
print HFILE "$proto\nextern short AuditCategories[];\n#define MaxAuditType $maxID\n\n#endif //AUDITDEFS_H\n";
print RFILE "}};\n";
chop $cats; print CFILE "short AuditCategories[] = {$cats};\n";

Bits/buildfnums

@@ -0,0 +1 @@
+search '#define FILE_NUM' Å.c | perl -x "{0}" {"Parameters"}
Exit {Status}
#!/usr/local/bin/perl

while (<>)
{
	s/File "//;
	s/\..* / /;
	chop;
	split;
	$f[$_[1]]=$_[0];
}

print "resource 'STR#' (28100,preload,locked) \{ \{ \n";
for ($i=1;$i<=$#f;$i++) {print qq=/* $i */ "$f[$i]",\n=;}
print " \} \};\n";

Bits/buildprefs

@@ -0,0 +1 @@
+$hfile = ":include:prefdefs.h";
$rfile = "PrefDefs.strn";
$cfile = "preflimits.c";
$dfile = "prefenable.c";
$efile = "$ARGV[0].extras";
$afile = "prefs.acap";
$xsfile = "prefs.xset";
$aufile = "prefaudit.c";

$idBase = 1000;

open(CFILE,">$cfile") || die;
open(DFILE,">$dfile") || die;
open(HFILE,">$hfile") || die;
open(RFILE,">$rfile") || die;
open(EFILE,"<$efile") || die;
open(AFILE,">$afile") || die;
open(XSFILE,">$xsfile") || die;
open(AUFILE,">$aufile") || die;

print CFILE <<'EOF';
#include <Types.h>
#include "PrefDefs.h"
#include "StringDefs.h"
Boolean PrefBounds(short prefN,long *lower,long *upper)
{
#ifdef LIGHT
	Boolean Light = true;
#else
	Boolean Light = false;
#endif

	long l,u;
	switch (prefN)
	{
EOF

print DFILE <<'EOF';
#include <Types.h>
#include "PrefDefs.h"
#include "StringDefs.h"
PersHandle SettingsPers(void);
#define ICCRAP	SettingsPers()!=PersList||!ReadIC||WriteIC
Boolean PrefEnabled(short prefN)
{
#ifdef LIGHT
	Boolean Light = true;
#else
	Boolean Light = false;
#endif

	switch (ABS(prefN))
	{
EOF
	
print HFILE <<'EOF';
#ifndef PREFDEFS_H
#define PREFDEFS_H

Boolean PrefBounds(short prefN,long *lower,long *upper);
Boolean PrefAudit(short prefN);
typedef enum {
	PREF_0,
EOF
	
print RFILE <<'EOF';
resource 'STH#' (1000,purgeable) {{
EOF

print AUFILE <<'EOF';
#include <Types.h>
#include "PrefDefs.h"
#define Audit	true
Boolean PrefAudit(short prefN)
{
	switch (ABS(prefN))
	{
EOF

#
# read the extra file
while (<EFILE>)
{
	chop;
	if ($_ ne "" && !/^#/)
	{
		split('\t');
		if (!/^-/)
		{
			$Extras{$_[0]} = $_[3];
		}
	}
}
	

$cnt = 0;
while (<>)
{
	chop;
	if ($_ ne "" && !/^#/)
	{
		split('\t');
		if (/^-/)
		{
			$name = $_[0];
			$name =~ s/.//;
			$acap = $func = "";
		}
		else
		{
			($name,$acap,$func) = split('¥',$_[0]);
			$cnt++;
			($help,$geek) = split('©©',$_[4]);
			if ($geek ne "") {$geekList .= "resource 'GSTR' (" . ($idBase+$cnt%100) . ",purgeable) {\"$geek\"};\n";}
			
			if ($Extras{$name} ne "") {$help = $Extras{$name};}
			
			if ($_[4] ne "" && !($_[4] =~ /don.t touch/i))
			{
				print XSFILE "<x-eudora-setting:$cnt> $_[4]\n";
			}
			print HFILE "/*$cnt*/\t$name,\n";
			print RFILE "/*$cnt $name*/\t\042$help\042,\n";
			if ($cnt == 100) {&newresource; next;}
			if ($cnt == 200) {&newresource2; next;}
			if ($cnt == 300) {&newresource3; next;}
		}
		if ($_[3] ne "")
		{
			print AUFILE "		case $name: return($_[3]);\n";
		}
		if ($_[2] ne "")
		{
			@lims = split(/,/,$_[2]);
			print CFILE "		case $name: l=$lims[0]; u=$lims[1]; break;\n";
		}
		if ($_[1] ne "")
		{
			print DFILE "		case $name: return($_[1]);\n";
		}
		if ($acap ne "")
		{
			print AFILE "$cnt\t$acap\t$func\n";
		}
	}
}

&finishresource;
print CFILE <<'EOF';
		default: return(0);
	}
	*lower = l;
	*upper = u;
	return(-1);
}
EOF
print DFILE <<'EOF';
		default: return(True);
	}
}
EOF
	print HFILE <<'EOF';
	PREF_STRN_LIMIT
} PrefStrnEnum;

#endif
EOF

print AUFILE <<'EOF';
		default: return(false);
	}
}
EOF

if ($geekList ne "") {print RFILE $geekList;}

sub newresource
{
	&finishresource;
	print RFILE <<'EOF';
resource 'STH#' (900,purgeable) {{
EOF
	$idBase = 900;
}

sub newresource2
{
	&finishresource;
	print RFILE <<'EOF';
resource 'STH#' (700,purgeable) {{
EOF
	$idBase = 700;
}

sub newresource3
{
	&finishresource;
	print RFILE <<'EOF';
resource 'STH#' (20100,purgeable) {{
EOF
	$idBase = 20100;
}

sub finishresource
{
	print RFILE "}};\n\n";
}

Bits/buildtext

@@ -0,0 +1 @@
+#!/usr/local/bin/perl
foreach $f (@ARGV)
{
	open(STDIN,"<$f") || die;
	$f =~ s/\.[a-zA-Z]*$//;	# strip extension
	($name,$id) = split('=',$f);
	$name =~ s/.*://;	# strip path
	print "data 'TEXT' ($id," . '"' . "$name" . '"' . ",purgeable) {\n";
	$neednewline = 0;
	while(<STDIN>)
	{
		chop;
		s/"/\\"/g;
		if ($neednewline) {print '	"\n" ';}
		$neednewline = 1;
		print '	"' . $_ . '"' . "\n";
	}
	print "};\n";
}

Bits/makeindex

@@ -0,0 +1 @@
+#!/usr/local/bin/perl
while (<>)
{
	if (m=^/\*{30,}$=) {$takeit = 1;}	# separator line
	elsif ($takeit)										# last was separator
	{
		chop;split(' ');
		if ($_[0] eq "*")								# yep, looks right
		{
			shift(@_);										# strip off *
			$fn = shift(@_);							# grab fn name
			$ind{$fn} = sprintf("%4d %s",$.,"$ARGV " . join(" ",@_));
		}
		$takeit = 0;										# next line isn't special
	}
	if (eof) {close(ARGV);}	# reset $.
}

# output
foreach $k (sort keys ind)
{
	printf "%-24s %s\n",$k,$ind{$k};
}

Bits/makesegs

@@ -0,0 +1 @@
+#!/usr/local/bin/perl
$cfile = $ARGV[0]; shift;
$hfile = $ARGV[0]; shift;
while (<>)
{
  if (/^#pragma segment/)
  {
    chop;
    split;
    if ($_[2] ne "Main" && $_[2] ne "ObjSupport")
    {
      $seglist{$_[2]} = $_[2];
    }
  }
}

open(CFILE,">$cfile") || die "$cfile";
open(HFILE,">$hfile") || die "$hfile";
print CFILE "#include \"numcode.h\"\n";
foreach $seg (keys(%seglist))
{
	$count++;
  printf CFILE "#pragma segment %s\n",$seg;
  printf CFILE "void __Seg%s(void);\n",$seg;
  printf CFILE "void __Seg%s(void){}\n",$seg;
}
print CFILE <<"EOF";
#pragma segment Main
void UnloadSegments(void);
void UnloadSegments(void)
{
#if __profile__
	return;
#endif
	if (!CantLock && LockCode) return;
#ifdef THREADING_ON
/*
	this is a short term solution to the stack corruption bug that occurs when segments that 
	a thread is using are unloaded
*/
	if (GetNumBackgroundThreads ()) return;
#endif
EOF
foreach $seg (keys(%seglist))
{
  printf CFILE "  UnloadSeg(__Seg%s);\n",$seg;
}
print CFILE "}\n";

$count += 2;	# code 1 and code 0
print HFILE "#ifndef NUM_CODE\n#define NUM_CODE $count\n#endif\n";

Bits/processFilt

@@ -0,0 +1 @@
+open(SRC,"<$ARGV[0]") || die;
open(DEFS,">:include:$ARGV[0].h") || die;
open(RFIL,">$ARGV[0].r") || die;
open(CFIL,">$ARGV[0].c") || die;
open(EFIL,"<$ARGV[0].extras") || die;

#
# read the extras file
#
$n = 0;
while (<EFILE>)
{
	chop;
	($enum,$pass,$word,$item,$help) = split('\t');
	$EHelp{$enum} = $help;
	$n++;
}

#
# read the input file
#
$n = 0;
while (<SRC>)
{
	chop;
	($enum[$n],$pass[$n],$pro[$n],$word[$n],$item[$n],$help[$n]) = split('\t');
	($pass[$n],$multiple[$n]) = split(',',$pass[$n]);
	if ($enum[$n] ne "" && $EHelp{$enum[$n]} ne "")
	{
		$help[$n] = $EHelp{$enum[$n]};
	}
	$n++;
}

#
# prepare the .h file
#
print DEFS <<EOF;
#ifdef TWO
#ifndef FILTDEFS_H
#define FILTDEFS_H

typedef enum {
	flkZero,
EOF

for ($i=0;$i<$n;$i++)
{
	if ($enum[$i] eq "dash")
	{
		print DEFS "\tflkDash$i,\n";
	}
	else
	{
		print DEFS "\t$enum[$i],\n";
	}
}

print DEFS <<EOF;
	flkLimit
} FilterKeywordEnum;

#define FilterKeywordStrn 25200

void *FATable(FilterKeywordEnum fk);
short FAPass(FilterKeywordEnum fk);
short FAMultiple(FilterKeywordEnum fk);
Boolean FAProOnly(FilterKeywordEnum fk);
#endif
#endif
EOF

#
# prepare the .c file
#
print CFIL <<EOF;
#include "filtdefs.h"
EOF

for ($i=0;$i<$n;$i++)
{
	if ($item[$i] ne "")
	{
		print CFIL "extern void *FA$enum[$i](void);\n";
	}
}

print CFIL <<EOF;

#pragma segment FILTRUN
void *FATable(FilterKeywordEnum fk)
{
	switch (fk)
	{
EOF

for ($i=0;$i<$n;$i++)
{
	if ($item[$i] ne "")
	{
		print CFIL "\t\tcase $enum[$i]: return(FA$enum[$i]);\n";
	}
}

print CFIL <<EOF;
		default:
			return(nil);
	}
}
EOF

print CFIL <<EOF;

short FAPass(FilterKeywordEnum fk)
{
	switch (fk)
	{
EOF

for ($i=0;$i<$n;$i++)
{
	if ($item[$i] ne "")
	{
		print CFIL "\t\tcase $enum[$i]: return($pass[$i]);\n";
	}
}

print CFIL <<EOF;
		default: return(0);
	}
}
EOF
print CFIL <<EOF;

#pragma segment FilterWin
short FAMultiple(FilterKeywordEnum fk)
{
	switch (fk)
	{
EOF

for ($i=0;$i<$n;$i++)
{
	if ($item[$i] ne "")
	{
		print CFIL "\t\tcase $enum[$i]: return($multiple[$i]);\n";
	}
}

print CFIL <<EOF;
		default: return(0);
	}
}

Boolean FAProOnly(FilterKeywordEnum fk)
{
	switch (fk)
	{
EOF

for ($i=0;$i<$n;$i++)
{
	if ($item[$i] ne "" && $pro[$i] ne "Both")
	{
		print CFIL "\t\tcase $enum[$i]:\n";
	}
}

print CFIL <<EOF;
			return(1); break;
		default:
			return(0); break;
	}
}
EOF

#
# prepare the resource file
#

# the keyword strings
print RFIL <<EOF;
resource 'STR#' (25200,purgeable) {{
EOF
for ($i=0;$i<$n;$i++)
{
	print RFIL qq/\t"$word[$i]",\n/;
}
print RFIL "}};\n\n";

# the menu resource
print RFIL <<EOF;
resource 'MENU' (1535) {535, 63,allEnabled, enabled, "FActions", {
EOF
for ($i=0;$i<$n;$i++)
{
	if ($item[$i] ne "")
	{
		print RFIL qq/\t"$item[$i]", noIcon, noKey, noMark, plain,\n/;
	}
	elsif ($enum[$i] eq "dash")
	{
		print RFIL qq/\t"-",noIcon, noKey, noMark, plain,\n/;
	}
}

print RFIL "}};\n\n";

# then, the help strings
print RFIL <<EOF;
resource 'STR#' (535,purgeable) {{
EOF
for ($i=0;$i<$n;$i++)
{
	print RFIL qq/\t"$help[$i]",\n/;
}
print RFIL "}};\n\n";

# finally, the hmnu
print RFIL <<EOF;
resource 'hmnu' (535,purgeable) {HelpMgrVersion,0,0,0,
	HMSkipItem{},
	{
		HMSkipItem{},
EOF
$s = 0;
for ($i=0;$i<$n;$i++)
{
	if ($item[$i] ne "")
	{
		$s++;
		print RFIL qq/\t\tHMStringResItem{535,$s,535,$s,535,$s,535,$s},\n/;
	}
	elsif ($enum[$i] eq "dash")
	{
		$s++;
		print RFIL "\tHMSkipItem\{\},\n";
	}
}
print RFIL "}};\n\n";

#
# Uffdah, as we say here in the midwest.  We're done.
#

CarbonPreComp.pch

@@ -0,0 +1 @@
+#define TARGET_API_MAC_CARBON 1

#define OLDP2C 1
#include <ConditionalMacros.h>

/*
From keychain.h:
    Keychain is not in CarbonLib 1.0.2.  But, it is possible to still use 
    keychain on OS 8/9 in a CarbonLib based application, by setting  
    CALL_IN_KEYCHAIN_BUT_NOT_IN_CARBON to 1 on the command line or in a prefix
    file, weaklinking with KeychainLib, and testing for its existance 
    at runtime.
*/
#define CALL_IN_KEYCHAIN_BUT_NOT_IN_CARBON 1


/*	for emsapi-Mac.h - we need to define these for internal building */
#define	INTERNAL_FOR_QC
#define	INTERNAL_FOR_EUDORA

#pragma precompile_target  "CarbonPreCompPPC"
#define TWO
#include "SysDefs.c"

#include "MyDefs.h"

CreditDefs

@@ -0,0 +1 @@
+Rob Alexander
William Allen
Glenn Anderson
Scott Anderson
Roy Ang
Colleen Archer
Anthony Arellano
Danny Atwood
Diane Ayon
Beth Bacon
Mark Baker
Diana Baldwin
Dawn Beattie
James Becker
Craig Beck
Jeff Beckley
Ryan Belding
Jeff Belk
Kerry Berschauer
Megan Bilinski
Rob Blakeney
Julia Blumin
Anjanette Bodden
Michelle Bombet
Stu Bowen
Craig Brenner
Ken Breshears
Carrie Brooks
Mike Brooks
Greg Brown
Rachel Budlong
Linh Bui
Kim Bullock
Joseph Cadieux
Myra Callen
Roderick Campbell
Chad Chamberlain
Dave Champion
Hayung Choi
Patricia Chukwueke
Tamara Clark
Mark Coburn
Darcy Cohen
Bonnie Coons
Justine Correa
Kevin Crosthwaite
Tracy Crowe
Robert Cunningham
Mona Das
Richard Davis
Todd Davis
Janice Delperdang
John Dennis
Gregory Drew
Ron Durbin
Scott Dveris
Kathy Episcopo
Paul Erickson
Judy Epstein
Mark Erikson
Mike Fine
Gayle Frank
Lynn Fredricks
Marilyn Fuller
Joy Gacuya
Michael Gama
Bill Ganon
Rich Gardner
Jeff Gehlhaar
Randall Gellens
Tod Glenn
Cary Gordon
Mary Green
Arnold Gum
Genevieve Hadley
Jim Hall
Chuck Han
Steve Han
Erick Haswell
Terry Hatami
Kevin Hay
Karen Hesterman
Anita Hix
Mary Hobson
Lance Hoffman
Christine Holevas
David Hom
Bill Hultman
Gwen Huntley
Peter Jackson
Jeff Jacobs
Irwin Jacobs
Paul Jacobs
Steve Janoff
Sameer Jindal
Evalinn Johnson
Kathy Johnson
Susan Johnson
Nicole Jones
Devon Keel Manuel
Cathy Kell
Brian Kelley
Curt Kentner
Joel King
Evan Kleber
Ed Knowlton
Sudheer Koganti
Anand Krishnan
Selva Kucuk-Iaia
Tom Lafleur
Thomas Lambert
Jennifer Lanham
Craig Lauer
Chris Lecroy
Chris LeDoux
Flor Levandoski
Dorothy Lewis
Mark Lieberman
Burton Lo
Laurence Lundblade
Kolar Mahesh
Michael Mallick
Scott Manjourides
Julie Marrs
Robert Matias
Keith McIntyre
Kyle McKay
Daniel McNerthney
Rick McVickar
Jennie Mcgee
Judith Meade
Jackie Meyer
Jamie Milano
Laurie Milano
Brian Minear
Subhashis Mohanty
Kristene Montgomery
Carol Moser
Robert Mullin
Deborah Mundorff
Chris Murray
Susan Murphy
Bridget Musante
Gary Nash
Paul Nelles
Jackie Nichols
John Noerenberg
Peter Ochabski
Lee Oeth
Ben Ogdon
Leilani Ola
Robert Owens
Jason Palmer
Dylan Palomino
Matt Parks
Bruce Parry
Jeffrey Paulson
Jerry Pickering
Bruce Pleat
Dennis Poe
Marque Popp
Jeffrey Pritchard
Alex Quidang
David Reynoldson
Jim Riley
Matt Riley
Chris Robinson
Nancy Rogness
Jeff Ross
Kelly Ross
Wendell Ruotsi
Christina Sahhar
Willie Sakai
Scott Schoonhoven
Ann Schrader
Lara Scott
Grace Segal
Marsha Shine
Russell Simon
Mike Simpson
Marwan Sinno
John Sinott
Amber Skeen
Edward Smith
Helen Solano-Elson
Eugene Son
Steve Sprigg
Bill Stackhouse
Cheryl Stella
Josh Stephens
Sarah Stockwell
Bryan Stoll
Rich Sulpizio
Michele Suppes
Jim Susoy
Sue Tesoro
Tim Thome
Jeny Toth
Joe Toth
Danielle Troilo
Rhiannon Turkso
Brant Vasilieff
Kusuma Vellanki
Andrea Vogel
Rick Walker
David Walter
Tisha Warren
Dave Watrous
Kathy Weaver
Don Wells
John White
Tina Whitfield
Kathleen Whitton
Jeffery Wilkins
Benjamin Willetts
Al Wilson
Dayna Winter-Neuse
Praveen Yaramada
Allan Young

CrispinIMAP/Include/env.h

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

#ifndef ENV_H
#define ENV_H

/*
 * Program:	Environment routines
 *
 * Author:	Mark Crispin
 *		Networks and Distributed Computing
 *		Computing & Communications
 *		University of Washington
 *		Administration Building, AG-44
 *		Seattle, WA  98195
 *		Internet: MRC@CAC.Washington.EDU
 *
 * Date:	1 August 1988
 * Last Edited:	17 September 1996
 *
 * Copyright 1995 by the University of Washington
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notice appears in all copies and that both the
 * above copyright notice and this permission notice appear in supporting
 * documentation, and that the name of the University of Washington not be
 * used in advertising or publicity pertaining to distribution of the software
 * without specific, written prior permission.  This software is made available
 * "as is", and
 * THE UNIVERSITY OF WASHINGTON DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED,
 * WITH REGARD TO THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN
 * NO EVENT SHALL THE UNIVERSITY OF WASHINGTON BE LIABLE FOR ANY SPECIAL,
 * INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, TORT
 * (INCLUDING NEGLIGENCE) OR STRICT LIABILITY, ARISING OUT OF OR IN CONNECTION
 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 *
 */

/* Function prototypes */

void *env_parameters (long function,void *value);
void rfc822_date (char *date);
void rfc822_timezone (char *s,void *t);
void internal_date (char *date);
void server_traps (void *clkint,void *kodint,void *hupint,void *trmint);
long server_login (char *user,char *pass,int argc,char *argv[]);
char *mylocalhost (void);
char *myhomedir (void);
char *mailboxfile (char *dst,char *name);

#endif //ENC_H

CrispinIMAP/Include/env_mac.h

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

#ifndef ENV_MAC_H
#define ENV_MAC_H

/*
 * Program:	Macintosh environment routines
 *
 * Author:	Mark Crispin
 *		6158 Lariat Loop NE
 *		Bainbridge Island, WA  98110-2098
 *		Internet: MRC@Panda.COM
 *
 * Date:	25 May 1995
 * Last Edited:	25 May 1995
 *
 * Copyright 1995 by Mark Crispin
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notices appear in all copies and that both the
 * above copyright notices and this permission notice appear in supporting
 * documentation, and that the name of Mark Crispin not be used in advertising
 * or publicity pertaining to distribution of the software without specific,
 * written prior permission.  This software is made available "as is", and
 * MARK CRISPIN DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, WITH REGARD TO
 * THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN NO EVENT SHALL
 * MARK CRISPIN BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES
 * OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
 * WHETHER IN AN ACTION OF CONTRACT, TORT (INCLUDING NEGLIGENCE) OR STRICT
 * LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
 * THIS SOFTWARE.
 *
 */


#define SUBSCRIPTIONFILE(t) sprintf (t,"%s:Mailbox List",myhomedir ())
#define SUBSCRIPTIONTEMP(t) sprintf (t,"%s:Mailbox List Temp",myhomedir ())

/* Function prototypes */

#include "env.h"

#endif //ENC_MAC_H

CrispinIMAP/Include/fs.h

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

#ifndef FS_H
#define FS_H

/*
 * Program:	Free storage management routines
 *
 * Author:	Mark Crispin
 *		Networks and Distributed Computing
 *		Computing & Communications
 *		University of Washington
 *		Administration Building, AG-44
 *		Seattle, WA  98195
 *		Internet: MRC@CAC.Washington.EDU
 *
 * Date:	1 August 1988
 * Last Edited:	14 April 1994
 *
 * Copyright 1994 by the University of Washington
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notice appears in all copies and that both the
 * above copyright notice and this permission notice appear in supporting
 * documentation, and that the name of the University of Washington not be
 * used in advertising or publicity pertaining to distribution of the software
 * without specific, written prior permission.  This software is made available
 * "as is", and
 * THE UNIVERSITY OF WASHINGTON DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED,
 * WITH REGARD TO THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN
 * NO EVENT SHALL THE UNIVERSITY OF WASHINGTON BE LIABLE FOR ANY SPECIAL,
 * INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, TORT
 * (INCLUDING NEGLIGENCE) OR STRICT LIABILITY, ARISING OUT OF OR IN CONNECTION
 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 *
 */


/* Function prototypes */

void *fs_get (size_t size);
void fs_resize (void **block,size_t size);
void fs_give (void **block);

#endif //FS_H

CrispinIMAP/Include/ftl.h

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

#ifndef FTL_H
#define FTL_H

/*
 * Program:	Crash management routines
 *
 * Author:	Mark Crispin
 *		Networks and Distributed Computing
 *		Computing & Communications
 *		University of Washington
 *		Administration Building, AG-44
 *		Seattle, WA  98195
 *		Internet: MRC@CAC.Washington.EDU
 *
 * Date:	1 August 1988
 * Last Edited:	14 April 1994
 *
 * Copyright 1994 by the University of Washington
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notice appears in all copies and that both the
 * above copyright notice and this permission notice appear in supporting
 * documentation, and that the name of the University of Washington not be
 * used in advertising or publicity pertaining to distribution of the software
 * without specific, written prior permission.  This software is made available
 * "as is", and
 * THE UNIVERSITY OF WASHINGTON DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED,
 * WITH REGARD TO THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN
 * NO EVENT SHALL THE UNIVERSITY OF WASHINGTON BE LIABLE FOR ANY SPECIAL,
 * INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, TORT
 * (INCLUDING NEGLIGENCE) OR STRICT LIABILITY, ARISING OUT OF OR IN CONNECTION
 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 *
 */


/* Function prototypes */

void fatal (char *string);

#endif //FTL_H

CrispinIMAP/Include/linkage.c

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

/*
 * Program:	Default driver linkage
 *
 * Author:	Mark Crispin
 *		Networks and Distributed Computing
 *		Computing & Communications
 *		University of Washington
 *		Administration Building, AG-44
 *		Seattle, WA  98195
 *		Internet: MRC@CAC.Washington.EDU
 *
 * Date:	13 June 1995
 * Last Edited:	7 October 1996
 *
 * Copyright 1994 by the University of Washington
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notice appears in all copies and that both the
 * above copyright notice and this permission notice appear in supporting
 * documentation, and that the name of the University of Washington not be
 * used in advertising or publicity pertaining to distribution of the software
 * without specific, written prior permission.  This software is made available
 * "as is", and
 * THE UNIVERSITY OF WASHINGTON DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED,
 * WITH REGARD TO THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN
 * NO EVENT SHALL THE UNIVERSITY OF WASHINGTON BE LIABLE FOR ANY SPECIAL,
 * INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, TORT
 * (INCLUDING NEGLIGENCE) OR STRICT LIABILITY, ARISING OUT OF OR IN CONNECTION
 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 *
 */

  mail_link (&imapdriver);		/* link in the imap driver */
  auth_link (&auth_log);		/* link in the log authenticator */

CrispinIMAP/Include/linkage.h

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

#ifndef LINKAGE_H
#define LINKAGE_H

/*
 * Program:	Default driver linkage
 *
 * Author:	Mark Crispin
 *		Networks and Distributed Computing
 *		Computing & Communications
 *		University of Washington
 *		Administration Building, AG-44
 *		Seattle, WA  98195
 *		Internet: MRC@CAC.Washington.EDU
 *
 * Date:	13 June 1995
 * Last Edited:	7 October 1996
 *
 * Copyright 1994 by the University of Washington
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notice appears in all copies and that both the
 * above copyright notice and this permission notice appear in supporting
 * documentation, and that the name of the University of Washington not be
 * used in advertising or publicity pertaining to distribution of the software
 * without specific, written prior permission.  This software is made available
 * "as is", and
 * THE UNIVERSITY OF WASHINGTON DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED,
 * WITH REGARD TO THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN
 * NO EVENT SHALL THE UNIVERSITY OF WASHINGTON BE LIABLE FOR ANY SPECIAL,
 * INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, TORT
 * (INCLUDING NEGLIGENCE) OR STRICT LIABILITY, ARISING OUT OF OR IN CONNECTION
 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 *
 */

extern DRIVER imapdriver;
extern AUTHENTICATOR auth_log;

#endif //LINKAGE_H

CrispinIMAP/Include/misc.h

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

#ifndef MISC_H
#define MISC_H

/*
 * Program:	Miscellaneous utility routines
 *
 * Author:	Mark Crispin
 *		Networks and Distributed Computing
 *		Computing & Communications
 *		University of Washington
 *		Administration Building, AG-44
 *		Seattle, WA  98195
 *		Internet: MRC@CAC.Washington.EDU
 *
 * Date:	5 July 1988
 * Last Edited:	11 February 1997
 *
 * Sponsorship:	The original version of this work was developed in the
 *		Symbolic Systems Resources Group of the Knowledge Systems
 *		Laboratory at Stanford University in 1987-88, and was funded
 *		by the Biomedical Research Technology Program of the National
 *		Institutes of Health under grant number RR-00785.
 *
 * Original version Copyright 1988 by The Leland Stanford Junior University
 * Copyright 1997 by the University of Washington
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notices appear in all copies and that both the
 * above copyright notices and this permission notice appear in supporting
 * documentation, and that the name of the University of Washington or The
 * Leland Stanford Junior University not be used in advertising or publicity
 * pertaining to distribution of the software without specific, written prior
 * permission.  This software is made available "as is", and
 * THE UNIVERSITY OF WASHINGTON AND THE LELAND STANFORD JUNIOR UNIVERSITY
 * DISCLAIM ALL WARRANTIES, EXPRESS OR IMPLIED, WITH REGARD TO THIS SOFTWARE,
 * INCLUDING WITHOUT LIMITATION ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
 * FITNESS FOR A PARTICULAR PURPOSE, AND IN NO EVENT SHALL THE UNIVERSITY OF
 * WASHINGTON OR THE LELAND STANFORD JUNIOR UNIVERSITY BE LIABLE FOR ANY
 * SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER
 * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF
 * CONTRACT, TORT (INCLUDING NEGLIGENCE) OR STRICT LIABILITY, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 *
 */

/* KLUDGE ALERT!!!
 *
 * Yes, write() is overridden here instead of in osdep.  This
 * is because misc.h is one of the last files that most things #include, so
 * this should avoid problems with some system #include file.
 */

#define write safe_write


/* Some C compilers have these as macros */

#undef min
#undef max


/* Compatibility definitions */

#define pmatch(s,pat) \
  pmatch_full (s,pat,NIL)


/* Function prototypes */

char *ucase (char *string);
char *lcase (char *string);
char *cpystr (const char *string);
char *cpytxt (SIZEDTEXT *dst,char *text,unsigned long size);
char *textcpy (SIZEDTEXT *dst,SIZEDTEXT *src);
char *textcpystring (SIZEDTEXT *text,STRING *bs);
char *textcpyoffstring (SIZEDTEXT *text,STRING *bs,unsigned long offset,
			unsigned long size);
unsigned long find_rightmost_bit (unsigned long *valptr);
long min (long i,long j);
long max (long i,long j);
long search (char *s,long i,char *pat,long patc);
long fsrc (char *s,long i,char *pat,long patc);
long ssrc (char **s,long *i,char *pat,long patc,long maxtries);
long pmatch_full (char *s,char *pat,char delim);
long dmatch (char *s,char *pat,char delim);

#endif //MISC_H

CrispinIMAP/Include/netmsg.h

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

#ifndef NETMSG_H
#define NETMSG_H

/*
 * Program:	Network message (SMTP/NNTP/POP2/POP3) routines
 *
 * Author:	Mark Crispin
 *		Networks and Distributed Computing
 *		Computing & Communications
 *		University of Washington
 *		Administration Building, AG-44
 *		Seattle, WA  98195
 *		Internet: MRC@CAC.Washington.EDU
 *
 * Date:	8 June 1995
 * Last Edited:	5 February 1996
 *
 * Copyright 1996 by the University of Washington
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notice appears in all copies and that both the
 * above copyright notice and this permission notice appear in supporting
 * documentation, and that the name of the University of Washington not be
 * used in advertising or publicity pertaining to distribution of the software
 * without specific, written prior permission.  This software is made
 * available "as is", and
 * THE UNIVERSITY OF WASHINGTON DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED,
 * WITH REGARD TO THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN
 * NO EVENT SHALL THE UNIVERSITY OF WASHINGTON BE LIABLE FOR ANY SPECIAL,
 * INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, TORT
 * (INCLUDING NEGLIGENCE) OR STRICT LIABILITY, ARISING OUT OF OR IN CONNECTION
 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 *
 */


extern STRINGDRIVER netmsg_string;
void netmsg_string_init (STRING *s,void *data,unsigned long size);
char netmsg_string_next (STRING *s);
void netmsg_string_setpos (STRING *s,unsigned long i);
				/* stream must be void* for use as readfn_t */
long netmsg_read (void *stream,unsigned long count,char *buffer);
char *netmsg_slurp_text (TransStream stream,unsigned long *size);
FILE *netmsg_slurp (TransStream stream,unsigned long *size,unsigned long *hsiz);

#endif //NETMSG_H

CrispinIMAP/Include/nl.h

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

#ifndef NL_H
#define NL_H

/*
 * Program:	Newline routines
 *
 * Author:	Mark Crispin
 *		Networks and Distributed Computing
 *		Computing & Communications
 *		University of Washington
 *		Administration Building, AG-44
 *		Seattle, WA  98195
 *		Internet: MRC@CAC.Washington.EDU
 *
 * Date:	1 August 1988
 * Last Edited:	14 April 1994
 *
 * Copyright 1994 by the University of Washington
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notice appears in all copies and that both the
 * above copyright notice and this permission notice appear in supporting
 * documentation, and that the name of the University of Washington not be
 * used in advertising or publicity pertaining to distribution of the software
 * without specific, written prior permission.  This software is made available
 * "as is", and
 * THE UNIVERSITY OF WASHINGTON DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED,
 * WITH REGARD TO THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN
 * NO EVENT SHALL THE UNIVERSITY OF WASHINGTON BE LIABLE FOR ANY SPECIAL,
 * INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, TORT
 * (INCLUDING NEGLIGENCE) OR STRICT LIABILITY, ARISING OUT OF OR IN CONNECTION
 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 *
 */


/* Function prototypes */

unsigned long strcrlfcpy (char **dst,unsigned long *dstl,char *src,
			  unsigned long srcl);
unsigned long strcrlflen (STRING *s);

#endif //NL_H

CrispinIMAP/Include/os_mac.h

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

#ifndef OS_MAC_H
#define OS_MAC_H

/*
 * Program:	Operating-system dependent routines -- Macintosh version
 *
 * Author:	Mark Crispin
 *		6158 Lariat Loop NE
 *		Bainbridge Island, WA  98110-2098
 *		Internet: MRC@Panda.COM
 *
 * Date:	26 January 1992
 * Last Edited:	8 August 1995
 *
 * Copyright 1995 by Mark Crispin
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notice appears in all copies and that both the
 * above copyright notices and this permission notice appear in supporting
 * documentation, and that the name of Mark Crispin not be used in advertising
 * or publicity pertaining to distribution of the software without specific,
 * written prior permission.  This software is made available "as is", and
 * MARK CRISPIN DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, WITH REGARD TO
 * THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN NO EVENT SHALL
 * MARK CRISPIN BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES
 * OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
 * WHETHER IN AN ACTION OF CONTRACT, TORT (INCLUDING NEGLIGENCE) OR STRICT
 * LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
 * THIS SOFTWARE.
 *
 */


/*  This is a totally new operating-system dependent module for the Macintosh,
 * written using THINK C on my Mac PowerBook-100 in my free time.
 * Unlike earlier efforts, this version requires no external TCP library.  It
 * also takes advantage of the Map panel in System 7 for the timezone.
 */
#ifndef TWO
	#include <ansi_prefix.mac.h>
#endif

/*#include <limits.h>
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <types.h>
#include <unix.h>#include <Desk.h>
#include <Devices.h>
#include <Errors.h>
#include <Events.h>
#include <Fonts.h>
#include <Memory.h>
#include <Menus.h>
#include <ToolUtils.h>
#include <Windows.h>
#define tcp_port MacTCP_port
#include <MacTCPCommonTypes.h>
#include <AddressXlation.h>
#include <TCPPB.h>
#include <Files.h>
#include <Script.h>
#undef tcp_port
*/

#include <unistd.h>

#define L_SET SEEK_SET
#define L_INCR SEEK_CUR
#define L_XTND SEEK_END

extern short resolveropen;	/* make this global so caller can sniff */

#define gmtFlags u

#include "mail.h"
#include "osdep.h"
#include "misc.h"
#include "fs.h"
#include "ftl.h"
#include "nl.h"
#include "env.h"

#define TCPDRIVER "\p.IPP"

#define gethostid clock

long wait (void);
long random (void);

#endif //OS_MAC_H

CrispinIMAP/Include/osdep.h

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

#ifndef OSDEP_H
#define OSDEP_H

/*
 * Program:	Operating-system dependent routines -- Macintosh version
 *
 * Author:	Mark Crispin
 *		6158 Lariat Loop NE
 *		Bainbridge Island, WA  98110-2098
 *		Internet: MRC@Panda.COM
 *
 * Date:	13 June 1995
 * Last Edited:	13 June 1995
 *
 * Copyright 1995 by Mark Crispin
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notice appears in all copies and that both the
 * above copyright notices and this permission notice appear in supporting
 * documentation, and that the name of Mark Crispin not be used in advertising
 * or publicity pertaining to distribution of the software without specific,
 * written prior permission.  This software is made available "as is", and
 * MARK CRISPIN DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, WITH REGARD TO
 * THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN NO EVENT SHALL
 * MARK CRISPIN BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES
 * OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
 * WHETHER IN AN ACTION OF CONTRACT, TORT (INCLUDING NEGLIGENCE) OR STRICT
 * LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
 * THIS SOFTWARE.
 *
 */

#include "os_mac.h"

#endif //OSDEP_H

CrispinIMAP/auths.c

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

/*
 * Program:	Authenticator linkage -- Macintosh version
 *
 * Author:	Mark Crispin
 *		6158 Lariat Loop NE
 *		Bainbridge Island, WA  98110-2098
 *		Internet: MRC@Panda.COM
 *
 * Date:	6 December 1995
 * Last Edited:	6 December 1995
 *
 * Copyright 1995 by Mark Crispin
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notice appears in all copies and that both the
 * above copyright notices and this permission notice appear in supporting
 * documentation, and that the name of Mark Crispin not be used in advertising
 * or publicity pertaining to distribution of the software without specific,
 * written prior permission.  This software is made available "as is", and
 * MARK CRISPIN DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, WITH REGARD TO
 * THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN NO EVENT SHALL
 * MARK CRISPIN BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES
 * OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
 * WHETHER IN AN ACTION OF CONTRACT, TORT (INCLUDING NEGLIGENCE) OR STRICT
 * LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
 * THIS SOFTWARE.
 *
 */
#include "os_mac.h"
#define server_login(user,pass,argc,argv) NULL
#define myusername() ""		/* dummy definition to prevent build errors */
#include "auth_log.c"

CrispinIMAP/fs_mac.c

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

#define FILE_NUM 109
/*
 * Program:	Free storage management routines
 *
 * Author:	Mark Crispin
 *		Networks and Distributed Computing
 *		Computing & Communications
 *		University of Washington
 *		Administration Building, AG-44
 *		Seattle, WA  98195
 *		Internet: MRC@CAC.Washington.EDU
 *
 * Date:	1 August 1988
 * Last Edited:	15 June 1995
 *
 * Copyright 1995 by the University of Washington
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notice appears in all copies and that both the
 * above copyright notice and this permission notice appear in supporting
 * documentation, and that the name of the University of Washington not be
 * used in advertising or publicity pertaining to distribution of the software
 * without specific, written prior permission.  This software is made available
 * "as is", and
 * THE UNIVERSITY OF WASHINGTON DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED,
 * WITH REGARD TO THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN
 * NO EVENT SHALL THE UNIVERSITY OF WASHINGTON BE LIABLE FOR ANY SPECIAL,
 * INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, TORT
 * (INCLUDING NEGLIGENCE) OR STRICT LIABILITY, ARISING OUT OF OR IN CONNECTION
 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 *
 */

/* Get a block of free storage
 * Accepts: size of desired block
 * Returns: free storage block
 *
 */

void *fs_get (size_t size)
{
	OSErr err = noErr;
	void *block = 0;
	
	block = NuPtrClear (size ? size : (size_t) 1);
			
	if (!block || (err = MemError())) 
	{
		WarnUser(MEM_ERR,MemError()); 
		block = NIL;
	}

	return (block);
}


/* Resize a block of free storage
 * Accepts: ** pointer to current block
 *	    new size
 */

void fs_resize (void **block,size_t size)
{
	OSErr err = noErr;
	
	SetPtrSize(*block,size ? size : (size_t) 1);
	
	if (!block || (err = MemError())) 
	{
		WarnUser(MEM_ERR,MemError()); 
		block = NIL;
	}
}


/* Return a block of free storage
 * Accepts: ** pointer to free storage block
 */

void fs_give (void **block)
{
	if (*block) DisposePtr(*block);
	*block = 0;
}

CrispinIMAP/ftl_mac.c

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

/*
 * Program:	Mac crash management routines
 *
 * Author:	Mark Crispin
 *		6158 Lariat Loop NE
 *		Bainbridge Island, WA  98110-2098
 *		Internet: MRC@Panda.COM
 *
 * Date:	26 January 1992
 * Last Edited:	11 November 1993
 *
 * Copyright 1993 by Mark Crispin
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notice appears in all copies and that both the
 * above copyright notices and this permission notice appear in supporting
 * documentation, and that the name of Mark Crispin not be used in advertising
 * or publicity pertaining to distribution of the software without specific,
 * written prior permission.  This software is made available "as is", and
 * MARK CRISPIN DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, WITH REGARD TO
 * THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN NO EVENT SHALL
 * MARK CRISPIN BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES
 * OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
 * WHETHER IN AN ACTION OF CONTRACT, TORT (INCLUDING NEGLIGENCE) OR STRICT
 * LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
 * THIS SOFTWARE.
 *
 */

/* Report a fatal error
 * Accepts: string to output
 */

void fatal (char *string)
{
  mm_fatal (string);		/* pass up the string */
  abort ();			/* die horribly */
}

CrispinIMAP/linkage.c

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

/*
 * Program:	Default driver linkage
 *
 * Author:	Mark Crispin
 *		Networks and Distributed Computing
 *		Computing & Communications
 *		University of Washington
 *		Administration Building, AG-44
 *		Seattle, WA  98195
 *		Internet: MRC@CAC.Washington.EDU
 *
 * Date:	13 June 1995
 * Last Edited:	7 October 1996
 *
 * Copyright 1994 by the University of Washington
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notice appears in all copies and that both the
 * above copyright notice and this permission notice appear in supporting
 * documentation, and that the name of the University of Washington not be
 * used in advertising or publicity pertaining to distribution of the software
 * without specific, written prior permission.  This software is made available
 * "as is", and
 * THE UNIVERSITY OF WASHINGTON DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED,
 * WITH REGARD TO THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN
 * NO EVENT SHALL THE UNIVERSITY OF WASHINGTON BE LIABLE FOR ANY SPECIAL,
 * INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, TORT
 * (INCLUDING NEGLIGENCE) OR STRICT LIABILITY, ARISING OUT OF OR IN CONNECTION
 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 *
 */

  mail_link (&imapdriver);		/* link in the imap driver */
  auth_link (&auth_log);		/* link in the log authenticator */

CrispinIMAP/nl_mac.c

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

/*
 * Program:	Mac newline routines
 *
 * Author:	Mark Crispin
 *		6158 Lariat Loop NE
 *		Bainbridge Island, WA  98110-2098
 *		Internet: MRC@Panda.COM
 *
 * Date:	26 January 1992
 * Last Edited:	6 April 1996
 *
 * Copyright 1996 by Mark Crispin
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notice appears in all copies and that both the
 * above copyright notices and this permission notice appear in supporting
 * documentation, and that the name of Mark Crispin not be used in advertising
 * or publicity pertaining to distribution of the software without specific,
 * written prior permission.  This software is made available "as is", and
 * MARK CRISPIN DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, WITH REGARD TO
 * THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN NO EVENT SHALL
 * MARK CRISPIN BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES
 * OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
 * WHETHER IN AN ACTION OF CONTRACT, TORT (INCLUDING NEGLIGENCE) OR STRICT
 * LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
 * THIS SOFTWARE.
 *
 */

/* Copy string with CRLF newlines
 * Accepts: destination string
 *	    pointer to size of destination string buffer
 *	    source string
 *	    length of source string
 * Returns: length of copied string
 */

unsigned long strcrlfcpy (char **dst,unsigned long *dstl,char *src,
			  unsigned long srcl)
{
  long i,j;
  char c,*d = src;
				/* count number of CR's in source string(s) */
  for (i = srcl,j = 0; j < srcl; j++) if (*d++ == '\015') i++;
				/* flush destination buffer if too small */
  if (*dst && (i > *dstl)) fs_give ((void **) dst);
  if (!*dst) {			/* make a new buffer if needed */
    *dst = (char *) fs_get ((*dstl = i) + 1);
    if (dstl) *dstl = i;	/* return new buffer length to main program */
  }
  d = *dst;			/* destination string */
  while (srcl--) {		/* copy strings */
    c = *d++ = *src++;		/* copy character */
				/* append line feed to bare CR */
    if ((c == '\015') && (*src != '\012')) *d++ = '\012';
  }
  *d = '\0';			/* tie off destination */
  return d - *dst;		/* return length */
}


/* Length of string after strcrlfcpy applied
 * Accepts: source string
 * Returns: length of string
 */

unsigned long strcrlflen (STRING *s)
{
  unsigned long pos = GETPOS (s);
  unsigned long i = SIZE (s);
  unsigned long j = i;
  while (j--) if ((SNX (s) == '\015') && ((CHR (s) != '\012') || !j)) i++;
  SETPOS (s,pos);		/* restore old position */
  return i;
}

CrispinIMAP/os_mac.c

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

#ifdef	IMAP

/*
 * Program:	Operating-system dependent routines -- Macintosh version
 *
 * Author:	Mark Crispin
 *		6158 Lariat Loop NE
 *		Bainbridge Island, WA  98110-2098
 *		Internet: MRC@Panda.COM
 *
 * Date:	26 January 1992
 * Last Edited:	6 December 1995
 *
 * Copyright 1995 by Mark Crispin
 *
 *  Permission to use, copy, modify, and distribute this software and its
 * documentation for any purpose and without fee is hereby granted, provided
 * that the above copyright notice appears in all copies and that both the
 * above copyright notices and this permission notice appear in supporting
 * documentation, and that the name of Mark Crispin not be used in advertising
 * or publicity pertaining to distribution of the software without specific,
 * written prior permission.  This software is made available "as is", and
 * MARK CRISPIN DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, WITH REGARD TO
 * THIS SOFTWARE, INCLUDING WITHOUT LIMITATION ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, AND IN NO EVENT SHALL
 * MARK CRISPIN BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES
 * OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
 * WHETHER IN AN ACTION OF CONTRACT, TORT (INCLUDING NEGLIGENCE) OR STRICT
 * LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
 * THIS SOFTWARE.
 *
 */


/*  This is a totally new operating-system dependent module for the Macintosh,
 * written using THINK C on my Mac PowerBook-100 in my free time.
 * Unlike earlier efforts, this version requires no external TCP library.  It
 * also takes advantage of the Map panel in System 7 for the timezone.
 */

#define gmtFlags u

#include "mail.h"
#include "osdep.h"
#include "misc.h"

#pragma segment IMAP

#include "fs_mac.c"
#include "env_mac.c"
#include "ftl_mac.c"
#include "nl_mac.c"
#include "auths.c"

#endif	//IMAP

Editor/Source/Application Headers/peteUPP.h

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

/*
 * We're no longer using UPPs for PETE callbacks. (alb)
 */

/* UPP definitions for being called proc */
#define CallPETEHasBeenCalledProc(userRoutine, entry)		\
		(*(userRoutine))((entry))

/* UPP definitions for document change proc */
#define CallPETEDocHasChangedProc(userRoutine, ph, start, stop)		\
		(*(userRoutine))((ph), (start), (stop))

/* UPP definitions for set drag contents proc */
#define CallPETESetDragContentsProc(userRoutine, ph, theDragRef)		\
		(*(userRoutine))((ph), (theDragRef))

/* UPP definitions for get drag contents proc */
#define CallPETEGetDragContentsProc(userRoutine, ph, theText, theStyles, theParas, theDragRef, location)		\
		(*(userRoutine))((ph), (theText), (theStyles), (theParas), (theDragRef), (location))

/* UPP definitions for progress loop proc */
#define CallPETEProgressLoopProc(userRoutine)		\
		(*(userRoutine))()

/* UPP definitions for graphic handler proc */
#define CallPETEGraphicHandlerProc(userRoutine, ph, graphic, offset, message, data)		\
		(*(userRoutine))((ph), (graphic), (offset), (message), (data))

/* UPP definitions for word-break proc */
#define CallPETEWordBreakProc(userRoutine, ph, offset, leadingEdge, startOffset, endOffset, ws, charType)		\
		(*(userRoutine))((ph), (offset), (leadingEdge), (startOffset), (endOffset), (ws), (charType))

/* UPP definitions for intelligent cut proc */
#define CallPETEIntelligentCutProc(userRoutine, ph, start, stop)		\
		(*(userRoutine))((ph), (start), (stop))

/* UPP definitions for intelligent paste proc */
#define CallPETEIntelligentPasteProc(userRoutine, ph, offset, textScrap, styleScrap, paraScrap, added)		\
		(*(userRoutine))((ph), (offset), (textScrap), (styleScrap), (paraScrap), (added))

Editor/Source/Editor Source/chartypes.c

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

#include "petepch.h"

/* Check to see if the given text is all whitespace */
Boolean IsWhitespace(StringPtr theText, long textLen, ScriptCode script, WhiteInfoHandle whitespaceGlobals, long *leadWS)
{
	Boolean doubleByte, whiteSpace;
	short entryNum, numEntries;
	char *table;
	StringPtr entry, textPtr;
	WhiteSpaceTablePtr wTable;
	unsigned char textChars[3];

	if(leadWS != nil) {
		*leadWS = 0L;
	}
		
	if(textLen <= 0) {
		return false;
	}
	
	GetWhitespaceGlobals(whitespaceGlobals, script);
	doubleByte = (**whitespaceGlobals).doubleByte;	
	table = &(**whitespaceGlobals).table[0];
	wTable = ((WhiteSpaceTablePtr)(*(**whitespaceGlobals).itlHandle + (**whitespaceGlobals).offset));
	numEntries = wTable->numEntries;
	whiteSpace = false;
	
	do {
		textPtr = textChars;
		*textPtr++ = 1;
		
		switch(*textPtr = *theText++) {
			case kSpaceChar :
			case kTabChar :
			case kCarriageReturnChar :
			case kPageDownChar :
			case kLineFeedChar :
			case kNullChar :
				whiteSpace = true;
				if(leadWS != nil) {
					++*leadWS;
				}
				continue;
			default :
				;
		}
		
		if(doubleByte && table[*textPtr++]) {
			*textPtr = *theText++;
			++textChars[0];
		}
		
		for(whiteSpace = false, entryNum = 0;
		    !whiteSpace && (entryNum < numEntries);
		    ++entryNum) {
			
			textPtr = textChars;
			entry = (StringPtr)wTable + wTable->offset[entryNum];

			if((*entry++ == *textPtr++) && (*entry++ == *textPtr++) &&
			   ((textChars[0] == 1) || (*entry++ == *textPtr++))) {
				whiteSpace = true;
				if(leadWS != nil) {
					*leadWS += textChars[0];
				}
			}
		}
	} while (((textLen -= textChars[0]) > 0L) && whiteSpace);
	
	return whiteSpace;
}

/* Search for the next tab in the text */
long FindNextTab(Ptr theText, long textLen, long lastTab, long *tabCount)
{
	long textOffset;
	
	/* Start the search at past the last tab run */
	textOffset = lastTab + *tabCount;
	
	/* Clear the tab count */
	*tabCount = 0L;

	/* Make sure the offset is still within the text length */
	if(textOffset < textLen) {

		while((textOffset < textLen) && (theText[textOffset] != kTabChar)) {
			++textOffset;
		}
		
		if(textOffset == textLen) {
			textOffset = -1L;
		} else {
		
		/* A tab was found */
			/* Count the number of tabs in this run */
			do {
				++*tabCount;
			} while((textOffset + *tabCount < textLen) && (theText[textOffset + *tabCount] == kTabChar));
		}
	} else {
		textOffset = LONG_MAX;
	}

	return (textOffset >= 0L) ? textOffset : textLen;
}

Boolean FindNextFF(Ptr theText, long startOffset, long endOffset, long *ffLoc)
{
	register Ptr text;
	register long start, end;
	
	for(text = theText, start = startOffset, end = endOffset; start < end; ++start) {
		if(*text++ == kPageDownChar) {
			*ffLoc = startOffset;
			return true;
		}
	}
	return false;
}

Editor/Source/Editor Source/petepch.h

@@ -0,0 +1 @@
+/* Copyright (c) 2017, Computer History Museum 
All rights reserved. 
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to 
the limitations in the disclaimer below) provided that the following conditions are met: 
 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following 
   disclaimer in the documentation and/or other materials provided with the distribution. 
 * Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products 
   derived from this software without specific prior written permission. 
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE 
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 
DAMAGE. */

Editor/Source/Precompiled headers/PETEHeaders.pch

@@ -0,0 +1 @@
+#include <ConditionalMacros.h>
#if TARGET_CPU_PPC
#pragma precompile_target  "PETEHeadersPPC"
#else
#if TARGET_RT_MAC_CFM
#pragma precompile_target  "PETEHeadersCFM68K"
#else
#pragma precompile_target  "PETEHeaders68K"
#endif TARGET_RT_MAC_CFM
#endif TARGET_CPU_PPC

#pragma once on

#include "petepch.c"

Editor/Source/Precompiled headers/PETEHeadersCarbon.pch

@@ -0,0 +1 @@
+#define TARGET_API_MAC_CARBON 1

#include <ConditionalMacros.h>

/*
//	I don't want to take out all of the GENERATINGCFMs right now
#undef GENERATINGCFM
#define GENERATINGCFM 1
#undef PRAGMA_ALIGN_SUPPORTED
#define PRAGMA_ALIGN_SUPPORTED 1
#undef GENERATING68K
#define GENERATING68K 0
*/

#pragma precompile_target  "PETEHeadersCarbon"

#pragma once on

#include "petepch.c"