from small one page howto to huge articles all in one place

search text in:

Which kernel version do you use?

poll results

Last additions:
using iotop to find disk usage hogs

using iotop to find disk usage hogs






average rating: 1.7 (102 votes) (1=very good 6=terrible)

May 25th. 2007:




why adblockers are bad

Workaround and fixes for the current Core Dump Handling vulnerability affected kernels

Workaround and fixes for the current Core Dump Handling vulnerability affected kernels






average rating: 1.4 (42 votes) (1=very good 6=terrible)

April, 26th. 2006:

You are here: manpages


Section: POSIX Programmer's Manual (1P)
Updated: 2013
Index Return to Main Contents


This manual page is part of the POSIX Programmer's Manual. The Linux implementation of this interface may differ (consult the corresponding Linux manual page for details of Linux behavior), or the interface may not be implemented on Linux.



uuencode --- encode a binary file  


uuencode [-m] [file] decode_pathname


The uuencode utility shall write an encoded version of the named input file, or standard input if no file is specified, to standard output. The output shall be encoded using one of the algorithms described in the STDOUT section and shall include the file access permission bits (in chmod octal or symbolic notation) of the input file and the decode_pathname, for re-creation of the file on another system that conforms to this volume of POSIX.1-2008.  


The uuencode utility shall conform to the Base Definitions volume of POSIX.1-2008, Section 12.2, Utility Syntax Guidelines. The following option shall be supported by the implementation:
Encode the output using the MIME Base64 algorithm described in STDOUT. If -m is not specified, the historical algorithm described in STDOUT shall be used.


The following operands shall be supported:

The pathname of the file into which the uudecode utility shall place the decoded file. Specifying a decode_pathname operand of /dev/stdout shall indicate that uudecode is to use standard output. If there are characters in decode_pathname that are not in the portable filename character set the results are unspecified.
A pathname of the file to be encoded.


See the INPUT FILES section.  


Input files can be files of any type.  


The following environment variables shall affect the execution of uuencode:
Provide a default value for the internationalization variables that are unset or null. (See the Base Definitions volume of POSIX.1-2008, Section 8.2, Internationalization Variables for the precedence of internationalization variables used to determine the values of locale categories.)
If set to a non-empty string value, override the values of all the other internationalization variables.
Determine the locale for the interpretation of sequences of bytes of text data as characters (for example, single-byte as opposed to multi-byte characters in arguments and input files).

Determine the locale that should be used to affect the format and contents of diagnostic messages written to standard error.
Determine the location of message catalogs for the processing of LC_MESSAGES.





uuencode Base64 Algorithm

The standard output shall be a text file (encoded in the character set of the current locale) that begins with the line:

"begin-base64 %s %s\n", <mode>, <decode_pathname>
and ends with the line:

In both cases, the lines shall have no preceding or trailing <blank> characters. The encoding process represents 24-bit groups of input bits as output strings of four encoded characters. Proceeding from left to right, a 24-bit input group shall be formed by concatenating three 8-bit input groups. Each 24-bit input group then shall be treated as four concatenated 6-bit groups, each of which shall be translated into a single digit in the Base64 alphabet. When encoding a bit stream via the Base64 encoding, the bit stream shall be presumed to be ordered with the most-significant bit first. That is, the first bit in the stream shall be the high-order bit in the first byte, and the eighth bit shall be the low-order bit in the first byte, and so on. Each 6-bit group is used as an index into an array of 64 printable characters, as shown in Table 4-22, uuencode Base64 Values.

Table 4-22: uuencode Base64 Values
The character referenced by the index shall be placed in the output
The output stream (encoded bytes) shall be represented in lines of no

found in the table shall be ignored by decoding software (see                                                                    
available at the end of a message or encapsulated part of a message. A 
full encoding quantum shall always be completed at the end of a  
message. When fewer than 24 input bits are available in an input group,                     
zero bits shall be added (on the right) to form an integral number of  
6-bit groups. Output character positions that are not required to     
represent actual input data shall be set to the character      
Since all Base64 input is an integral number of octets, only the       
following cases can arise:                                                   
here, the final unit of encoded output shall be an integral multiple of                                                                                          
4 characters with no                                                               
The final quantum of encoding input is exactly 16 bits; here, the final                                                 
unit of encoded output shall be three characters followed by one                                                  
padding character.
The final quantum of encoding input is exactly 8 bits; here, the final
unit of encoded output shall be two characters followed by two
padding characters.
A terminating
evaluates to nothing and denotes the end of the encoded data.
The standard output shall be a text file (encoded in the character set
of the current locale) that begins with the line:
"begin %s %s\n" <mode>, <decode_pathname>
and ends with the line:
In both cases, the lines shall have no preceding or trailing
The algorithm that shall be used for lines in between
takes three octets as input and writes four characters of output by
splitting the input at six-bit intervals into four octets, containing
data in the lower six bits only. These octets shall be converted to
characters by adding a value of 0x20 to each octet, so that each octet
is in the range [0x20,0x5f], and then it shall be assumed to represent
a printable character in the ISO/IEC 646:1991 standard encoded character set. It then
shall be translated into the corresponding character codes for the
codeset in use in the current locale. (For example, the octet 0x41,
would be translated to
in the current codeset, such as 0xc1 if it were EBCDIC.)
Where the bits of two octets are combined, the least significant bits
of the first octet shall be shifted left and combined with the most
significant bits of the second octet shifted right. Thus the three
shall be converted into the four octets:
0x20 + (( A >> 2 ) & 0x3F)
0x20 + (((A << 4) | ((B >> 4) & 0xF)) & 0x3F)
0x20 + (((B << 2) | ((C >> 6) & 0x3)) & 0x3F)
0x20 + (( C ) & 0x3F)
These octets then shall be translated into the local character set.
Each encoded line contains a length character, equal to the number of
characters to be decoded plus 0x20 translated to the local character
set as described above, followed by the encoded characters. The
maximum number of octets to be encoded on each line shall be 45.
The standard error shall be used only for diagnostic messages.
The following exit values shall be returned:
Successful completion.
An error occurred.
The file is expanded by 35 percent (each three octets become four, plus
control information) causing it to take longer to transmit.
Since this utility is intended to create files to be used for data
interchange between systems with possibly different codesets, and to
represent binary data as a text file, the ISO/IEC 646:1991 standard was chosen for a
midpoint in the algorithm as a known reference point. The output from
is a text file on the local system. If the output were in the ISO/IEC 646:1991 standard
codeset, it might not be a text file (at least because the
characters might not match), and the goal of creating a text file would
be defeated. If this text file was then carried to another machine with
the same codeset, it would be perfectly compatible with that system's
If it was transmitted over a mail system or sent to a machine with a
different codeset, it is assumed that, as for every other text file,
some translation mechanism would convert it (by the time it reached a
user on the other system) into an appropriate codeset. This
translation only makes sense from the local codeset, not if the file
has been put into a ISO/IEC 646:1991 standard representation first. Similarly, files
processed by
can be placed in
archives, intermixed with other text files in the same codeset.
A new algorithm was added at the request of the international community
to parallel work in RFC 2045 (MIME). As with the historical
format, the Base64 Content-Transfer-Encoding is designed to represent
arbitrary sequences of octets in a form that is not humanly readable. A
65-character subset of the ISO/IEC 646:1991 standard is used, enabling 6 bits to be
represented per printable character. (The extra 65th character,
is used to signify a special processing function.)
This subset has the important property that it is represented
identically in all versions of the ISO/IEC 646:1991 standard, including US ASCII, and all
characters in the subset are also represented identically in all
versions of EBCDIC. The historical
algorithm does not share this property, which is the reason that a
second algorithm was added to the ISO POSIX-2 standard.
The string
was used for the termination instead of the end used in the original
format because the latter is a string that could be valid encoded
In an early draft, the
option was named
(for Base64), but it was renamed to reflect its relationship to the
RFC 2045. A
was also present to invoke the default algorithm, but since this was
not historical practice, it was omitted as being unnecessary.
See the RATIONALE section in
for the derivation of the
The Base Definitions volume of POSIX.1-2008,
Portions of this text are reprinted and reproduced in electronic form
from IEEE Std 1003.1, 2013 Edition, Standard for Information Technology
-- Portable Operating System Interface (POSIX), The Open Group Base
Specifications Issue 7, Copyright (C) 2013 by the Institute of
Electrical and Electronics Engineers, Inc and The Open Group.
(This is POSIX.1-2008 with the 2013 Technical Corrigendum 1 applied.) In the
event of any discrepancy between this version and the original IEEE and
The Open Group Standard, the original IEEE and The Open Group Standard
is the referee document. The original Standard can be obtained online at .
Any typographical or formatting errors that appear
in this page are most likely
to have been introduced during the conversion of the source files to
man page format. To report such errors, see .



uuencode Base64 Algorithm

Support us on Content Nation
rdf newsfeed | rss newsfeed | Atom newsfeed
- Powered by LeopardCMS - Running on Gentoo -
Copyright 2004-2020 Sascha Nitsch Unternehmensberatung GmbH
Valid XHTML1.1 : Valid CSS : buttonmaker
- Level Triple-A Conformance to Web Content Accessibility Guidelines 1.0 -
- Copyright and legal notices -
Time to create this page: 14.7 ms