|
|
1.1 ! root 1: .\" @(#)uuencode.5 6.1 (Berkeley) 5/15/85 ! 2: .\" ! 3: .TH UUENCODE 5 "May 15, 1985" ! 4: .AT 3 ! 5: .SH NAME ! 6: uuencode \- format of an encoded uuencode file ! 7: .SH DESCRIPTION ! 8: Files output by ! 9: .I uuencode(1C) ! 10: consist of a header line, ! 11: followed by a number of body lines, ! 12: and a trailer line. ! 13: .I Uudecode(1C) ! 14: will ignore any lines preceding the header or ! 15: following the trailer. ! 16: Lines preceding a header must not, of course, ! 17: look like a header. ! 18: .PP ! 19: The header line is distinguished by having the first ! 20: 6 characters \*(lqbegin\ \*(rq. ! 21: The word ! 22: .I begin ! 23: is followed by a mode (in octal), ! 24: and a string which names the remote file. ! 25: A space separates the three items in the header line. ! 26: .PP ! 27: The body consists of a number of lines, each at most 62 characters ! 28: long (including the trailing newline). ! 29: These consist of a character count, ! 30: followed by encoded characters, ! 31: followed by a newline. ! 32: The character count is a single printing character, ! 33: and represents an integer, the number of bytes ! 34: the rest of the line represents. ! 35: Such integers are always in the range from 0 to 63 and can ! 36: be determined by subtracting the character space (octal 40) ! 37: from the character. ! 38: .PP ! 39: Groups of 3 bytes are stored in 4 characters, 6 bits per character. ! 40: All are offset by a space to make the characters printing. ! 41: The last line may be shorter than the normal 45 bytes. ! 42: If the size is not a multiple of 3, this fact can be determined ! 43: by the value of the count on the last line. ! 44: Extra garbage will be included to make the character count a multiple ! 45: of 4. ! 46: The body is terminated by a line with a count of zero. ! 47: This line consists of one ASCII space. ! 48: .PP ! 49: The trailer line consists of \*(lqend\*(rq on a line by itself. ! 50: .SH "SEE ALSO" ! 51: uuencode(1C), uudecode(1C), uusend(1C), uucp(1C), mail(1)
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.