pkg://uudeview-0.5.13-7.src.rpm:262609/uudeview-0.5.13.tar.gz
info downloads
uudeview-0.5.13/ 40755 310 144 0 6274340567 10775 5 ustar fp fpp uudeview-0.5.13/doc/ 40755 310 144 0 6274340536 11536 5 ustar fp fpp uudeview-0.5.13/doc/README 100644 310 144 1626 6174254653 12523 0 ustar fp fpp
This directory contains the documentation of the UUDeview Decoding
Library programming interface. It is of interest only if you want
to use the decoding/encoding functions from your own applications,
and is not intended for users of the ready-made programs.
The documentation is distributed in LaTeX format (requiring LaTeX
version 2e). You can request Postscript and HTML formatted files
from the author by email. Please understand that I cannot provide
printed documentation.
If you have LaTeX 2e installed, just run make to compile the text
into a DVI file, which can be viewed with xdvi. Run 'make ps' to
create a printable Postscript document.
Even if you can't read the doc, you can take a look at the sample
C files (they show the "evolution" of the "Trivial Decoder") to
see how easy it is to include decoding support into your programs.
Frank Pilhofer <fp@informatik.uni-frankfurt.de>
uudeview-0.5.13/doc/Makefile 100644 310 144 1236 6160521461 13265 0 ustar fp fpp #
# $Id: Makefile,v 1.2 1996/06/15 11:49:05 fp Exp $
#
DVI = library.dvi
PS = ${DVI:.dvi=.ps}
LATEX = latex
DVIPS = dvips
FIG2DEV = fig2dev
.SUFFIXES:
.SUFFIXES: .ltx .dvi .ps .fig .tex .eps
all: $(DVI)
dvi: $(DVI)
ps: $(PS)
library.ps: library.dvi
library.dvi: library.ltx structure.tex binhex.tex
clean:
rm -f *.aux *.log *.toc *~
rm -f *.o td-v1 td-v2 td-v3
distclean: clean
for fig in *.fig ; do \
rm -f `basename $$fig .fig`.eps ; \
rm -f `basename $$fig .fig`.tex ; \
done
rm -f *.dvi *.ps
.ltx.dvi:
$(LATEX) $<
$(LATEX) $<
.dvi.ps:
$(DVIPS) -f < $< > $@
.fig.tex:
$(FIG2DEV) -L latex < $< > $@
.fig.eps:
$(FIG2DEV) -L ps < $< > $@
uudeview-0.5.13/doc/binhex.fig 100644 310 144 6135 6160775301 13600 0 ustar fp fpp #FIG 3.1
Portrait
Center
Inches
1200 2
2 2 0 1 -1 7 0 0 -1 0.000 0 0 0 0 0 5
1200 1500 1350 1500 1350 1800 1200 1800 1200 1500
2 2 0 1 -1 7 0 0 -1 0.000 0 0 0 0 0 5
1350 1500 2400 1500 2400 1800 1350 1800 1350 1500
2 2 0 1 -1 7 0 0 -1 0.000 0 0 0 0 0 5
2400 1500 2550 1500 2550 1800 2400 1800 2400 1500
2 2 0 1 -1 7 0 0 -1 0.000 0 0 0 0 0 5
2550 1500 3150 1500 3150 1800 2550 1800 2550 1500
2 2 0 1 -1 7 0 0 -1 0.000 0 0 0 0 0 5
3150 1500 3750 1500 3750 1800 3150 1800 3150 1500
2 2 0 1 -1 7 0 0 -1 0.000 0 0 0 0 0 5
4050 1500 4650 1500 4650 1800 4050 1800 4050 1500
2 2 0 1 -1 7 0 0 -1 0.000 0 0 0 0 0 5
4650 1500 5250 1500 5250 1800 4650 1800 4650 1500
2 2 0 1 -1 7 0 0 -1 0.000 0 0 0 0 0 5
3750 1500 4050 1500 4050 1800 3750 1800 3750 1500
2 2 0 1 -1 7 0 0 -1 0.000 0 0 0 0 0 5
5250 1500 5550 1500 5550 1800 5250 1800 5250 1500
2 2 0 1 -1 7 0 0 -1 0.000 0 0 0 0 0 5
5252 2252 5552 2252 5552 2552 5252 2552 5252 2252
2 2 0 1 -1 7 0 0 -1 0.000 0 0 0 0 0 5
5252 3002 5552 3002 5552 3302 5252 3302 5252 3002
2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 4
4500 2550 1200 2550 1200 2250 4500 2250
2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 4
4500 3300 1200 3300 1200 3000 4500 3000
2 1 1 1 -1 7 0 0 -1 4.000 0 0 -1 0 0 2
4500 2250 5250 2250
2 1 1 1 -1 7 0 0 -1 4.000 0 0 -1 0 0 2
4500 2550 5250 2550
2 1 1 1 -1 7 0 0 -1 4.000 0 0 -1 0 0 2
4500 3000 5250 3000
2 1 1 1 -1 7 0 0 -1 4.000 0 0 -1 0 0 2
4500 3300 5250 3300
4 1 -1 0 0 0 12 0.0000000 0 90 90 1275 1725 n\001
4 1 -1 0 0 0 12 0.0000000 0 135 450 1875 1725 Name\001
4 1 -1 0 0 0 12 0.0000000 0 135 90 2475 1725 0\001
4 1 -1 0 0 0 12 0.0000000 0 180 375 2850 1725 Type\001
4 1 -1 0 0 0 12 0.0000000 0 135 375 3450 1725 Auth\001
4 1 -1 0 0 0 12 0.0000000 0 135 360 4350 1725 Dlen\001
4 1 -1 0 0 0 12 0.0000000 0 135 345 4950 1725 Rlen\001
4 1 -1 0 0 0 10 0.0000000 0 75 75 1875 1425 n\001
4 1 -1 0 0 0 10 0.0000000 0 105 75 2475 1425 1\001
4 1 -1 0 0 0 10 0.0000000 0 105 75 2850 1425 4\001
4 1 -1 0 0 0 10 0.0000000 0 105 75 3450 1425 4\001
4 1 -1 0 0 0 10 0.0000000 0 105 75 3900 1425 2\001
4 1 -1 0 0 0 10 0.0000000 0 105 75 4350 1425 4\001
4 1 -1 0 0 0 10 0.0000000 0 105 75 4950 1425 4\001
4 1 -1 0 0 0 10 0.0000000 0 105 75 5400 1425 2\001
4 2 -1 0 0 0 12 0.0000000 0 135 555 1125 1575 Header\001
4 2 -1 0 0 0 12 0.0000000 0 135 570 1125 1845 Section\001
4 1 -1 0 0 0 10 0.0000000 0 105 75 1275 1425 1\001
4 1 -1 0 0 0 10 0.0000000 0 105 225 5400 1725 HC\001
4 1 -1 0 0 0 10 0.0000000 0 105 75 5401 2176 2\001
4 2 -1 0 0 0 12 0.0000000 0 135 375 1127 2327 Data\001
4 2 -1 0 0 0 12 0.0000000 0 135 570 1127 2597 Section\001
4 1 -1 0 0 0 12 0.0000000 0 135 765 3227 2477 Data Fork\001
4 1 -1 0 0 0 10 0.0000000 0 105 300 3227 2177 Dlen\001
4 1 -1 0 0 0 10 0.0000000 0 105 210 5402 2477 DC\001
4 1 -1 0 0 0 10 0.0000000 0 105 75 5401 2926 2\001
4 2 -1 0 0 0 12 0.0000000 0 135 720 1127 3077 Resource\001
4 2 -1 0 0 0 12 0.0000000 0 135 570 1127 3347 Section\001
4 1 -1 0 0 0 12 0.0000000 0 135 1110 3227 3227 Resource Fork\001
4 1 -1 0 0 0 10 0.0000000 0 105 300 3227 2927 Rlen\001
4 1 -1 0 0 0 10 0.0000000 0 105 210 5402 3227 RC\001
4 1 -1 0 0 0 10 0.0000000 0 135 285 3900 1725 Flag\001
uudeview-0.5.13/doc/td-v1.c 100644 310 144 374 6155632130 12706 0 ustar fp fpp #include <stdio.h>
#include <stdlib.h>
#include <config.h>
#include <uudeview.h>
int main (int argc, char *argv[])
{
UUInitialize ();
UULoadFile (argv[1], NULL, 0);
UUDecodeFile (UUGetFileListItem (0), NULL);
UUCleanUp ();
return 0;
}
uudeview-0.5.13/doc/library.ltx 100644 310 144 276767 6265177421 14122 0 ustar fp fpp \NeedsTeXFormat{LaTeX2e}
\documentclass{article}
\usepackage{psfig}
\author{Frank Pilhofer}
\title{The UUDeview Decoding Library}
\providecommand{\ush}{\discretionary{-}{}{\_}}
\providecommand{\uuversion}{0.5}
\providecommand{\uupatch}{13}
%
% $Id: library.ltx,v 1.17 1997/01/09 14:22:09 fp Exp $
%
\begin{document}
\maketitle
\begin{abstract}
The UUDeview library is a highly portable set of functions that
provide facilities for decoding \emph{uuencoded}, \emph{xxencoded},
\emph{Base64} and \emph{BinHex}-Encoded files as well as for
encoding binary files into all of these representations except
BinHex. This document describes how the features of encoding
and decoding can be integrated into your own applications.
The information is intended for developers only, and is not required
reading material for end users. It is assumed that the reader is
familiar with the general issue of encoding and decoding and has some
experience with the ``C'' programming language.
This document describes version \uuversion{}, patchlevel \uupatch{}
of the library.
\end{abstract}
\section{Introduction}
\subsection{Background}
The Internet provides us with a fast and reliable means of user-to-user
message delivery, using private email or newsgroups. Both systems have
originally been designed to transport plain-text messages. Over the
years, some methods appeared allowing transport of arbitrary binary
data by ``encoding'' the data into plain-text messages. But after
these years, there are still certain problems handling the encoded
data, and many recipients have difficulties decoding the messages back
into their original form.
It should be the job of the mail delivery agent to handle sending and
rend receiving binary data transparently. However, the support of most
applications is limited, and several incompatibilities among different
software exists.
There are three common formats for encoding binary data, called
\emph{uuencoding}, \emph{Base64} and \emph{BinHex}. Issues are further
complicated by slight variations of the formats, the packaging, and
some broken implementations.
Further problems arise with multi-part postings, where the encoding
of a huge file has been split up into several individual messages to
ensure proper transfer over gateways with limited message sizes. Very
few software is able to properly sort and decode the parts. Even
nowadays, many users are at a loss to decode these kinds of messages.
This is where the UUDeview Decoding Library steps in.
\subsection{The Library}
The UUDeview library makes an attempt at decoding nearly all
kinds of encoded files. It is supposed to decode multi-part files as
well as many files simultaneously. Part numbers are evaluated, thus
making it possible to re-arrange parts that aren't in their correct
order.
No assumptions are made on the format of the input file. Usually the
input will be an email folder or newsgroup messages. If this is the
case, the information found in header lines is evaluated; but plain
encoded files with no surrounding information are also accepted. The
input may also consist of concatenated parts and files.
Decoding files is done in two passes. During the first pass, all input
files are scanned. Information is gathered about each chunk of encoded
data. Besides the obvious data about type, position and size of the
chunk, some environmental information from the envelope of a mail
message is also gathered if available.
If the scanner finds a properly MIME-formatted message, a proper MIME
parser steps into action. Because MIME messages include precise
information about the message's contents, there is seldom doubt about
its parts.
For other, non-MIME messages, the ``Subject'' header line is closely
examined. Two informations are extracted: the part number (usually
given in parentheses) and a unique identifier, which is used to group
series of postings. If the subject is, for example, ``uudeview.tgz
(01/04)'', the scanner concludes that this message is the first in a
series of four, and the indicated filename is an ideal key to identify
each of the four parts.
If the subject is incomplete (no part number) or missing, the scanner
tries to make the best of the available information, but some of the
advanced features won't work. For example, without any information
about the part number, it must be assumed that the available parts are
in correct order and can't be automatically rearranged.
All the information is gathered in a linked list. An application can
then examine the nodes of the list and pick individual items for
decoding. The decoding functions will then visit the parts of a file
in correct order and extract the binary data.
Because of heavy testing of the routines against real-life data
and many problem reports from users, the functions have become very
robust, even against input files with few, missing or broken
information.
\begin{figure}
\centering
\makebox{\input{structure.tex}}
\caption{Integration of the Library}
\label{structure}
\end{figure}
Figure \ref{structure} displays how the library can be integrated into
an application. The library does not assume any capabilities of the
operating system or application language, and can thus be used in
almost any environment. The few necessary interfaces must be provided
by the application, which does usually know a great deal more about
the target system.
The idea of the ``language interface'' is to allow integration of the
library services into other programming languages; if the application
is itself written in C, there's no need for a separate interface, of
course. Such an interface currently exists for the Tcl scripting
language; other examples might be Visual Basic, Perl or Delphi.
\subsection{Terminology}
These are some buzzwords that will be used in the following text.
\begin{itemize}
\item
``Encoded data'' is binary data encoded by one of the methods
``uuencoding'', ``xxencoding'', ``Base64'' or ``BinHex''.
\item
``Message'' refers to both complete email messages and Usenet news
postings, including the complete headers. The format of a message is
described in \cite{rfc0822}. A ``message body'' is an email message
or news posting without headers.
\item
A ``mail folder'' is a number of concatenated messages.
\item
``MIME'' refers to the standards set in \cite{rfc1521}.
\item
A ``multipart message'' is an entity described by the MIME
standard. It is a single message divided into one or more individual
parts by a unique boundary.
\item
A ``partial message'' is also described by the MIME standard. It is a
message with an associated identifier and a part number. Large
messages can be split into multiple partial messages on the sender's
side. The recipient's software groups the partial messages by their
identifier and composes them back into the original large message.
\item
The term ``partial message'' only refers to \emph{one part} of the
large message. The original, partialized message is referred to as
``multi-part message'' (note the hyphen). To clarify, one part of a
multi-part message is a partial message.
\end{itemize}
\section{Compiling the Library}
On Unix systems, configuration and compilation is trivial. The
script \texttt{configure} automatically checks your
system and configures the library appropriately. A subsequent
``make'' compiles the modules and builds the final library.
On other systems, you must manually create the configuration file and
the Makefile. The configuration file \texttt{config.h} contains a set
of preprocessor definitions and macros that describe the available
features on your systems.
\subsection{Creating \texttt{config.h} by hand}
You can find all available definitions in \texttt{config.h.in}. This
file undefines all possible definitions; you can create your own
configuration file starting from \texttt{config.h.in} and editing the
necessary differences.
Most definitions are either present or absent, only a few need to have
a value. If not explicitly mentioned, you can activate a definition
by changing the default \texttt{undef} into \texttt{define}.
The following definitions are available:
\subsubsection{System Specific}
\begin{description}
\item[\texttt{SYSTEM\_DOS}]
Define for compilation on a \emph{DOS} system. Currently unused.
\item[\texttt{SYSTEM\_QUICKWIN}]
Define for compilation within a \emph{QuickWin}\footnote{The
Microsoft compilers offer the \emph{QuickWin} target to allow
terminal-oriented programs to run in the Windows environment}
program. Currently unused.
\item[\texttt{SYSTEM\_WINDLL}]
Causes all modules to include \texttt{<windows.h>} before any other
include file. Makes \texttt{uulib.c} export a
\texttt{Dll\-Entry\-Point} function.
\item[\texttt{SYSTEM\_OS2}]
Causes all modules to include \texttt{<os2.h>} before any other
include file.
\end{description}
\subsubsection{Compiler Specific}
\begin{description}
\item[\texttt{PROTOTYPES}]
Define if your compiler supports function prototypes.
\item[\texttt{UUEXPORT}]
This can be a declaration to all functions exported from the decoding
library. Frequently needed when compiling into a shared library.
\item[\texttt{TOOLEXPORT}]
Similar to \texttt{TOOL\-EXPORT}, but for the helper functions from
the replacement functions in \texttt{fptools.c}.
\end{description}
\subsubsection{Header Files}
There are a number of options that define whether header files are
available on your system. Don't worry if some of them are not. If a
header file is present, define ``\texttt{HAVE\_}\emph{name-of-header}'':
\texttt{HAVE\ush{}ERRNO\_H},
\texttt{HAVE\ush{}FCNTL\_H},
\texttt{HAVE\ush{}IO\_H},
\texttt{HAVE\ush{}MALLOC\_H},
\texttt{HAVE\ush{}MEMORY\_H},
\texttt{HAVE\ush{}UNISTD\_H} and
\texttt{HAVE\ush{}SYS\_TIME\_H}
(for \texttt{<sys/time.h>}). Some other include files are needed
as well, but there are no macros for mandatory include files.
There's also a number of header-specific definitions that do not fit
into the general present-or-not-present scheme.
\begin{description}
\item[\texttt{STDC\_HEADERS}]
Define if your header files conform to \emph{ANSI C}. This requires
that \texttt{stdarg.h} is present, that \texttt{stdlib.h} is
available, defining both \texttt{malloc()} and \texttt{free()}, and
that \texttt{string.h} defines the memory functions family
(\texttt{memcpy()} etc).
\item[\texttt{HAVE\_STDARG\_H}]
Implicitly set by \texttt{STDC\ush{}HEADERS}. You only need to define
this one if \texttt{STDC\ush{}HEADERS} is not defined but
\texttt{<stdarg.h>} is available.
\item[\texttt{HAVE\_VARARGS\_H}]
\emph{varargs} can be used as an alternative to \emph{stdarg}. Define
if the above two values are undefined and \texttt{<varargs.h>} is
available.
\item[\texttt{TIME\_WITH\_SYS\_TIME}]
Define if \texttt{HAVE\ush{}SYS\ush{}TIME\_H} and if both \texttt{<sys/time.h>}
and \texttt{<time.h>} can be included without conflicting definitions.
\end{description}
\subsubsection{Functions}
\begin{description}
\item[\texttt{HAVE\_STDIO}]
Define if standard I/O (\texttt{stdin}, \texttt{stdout} and
\texttt{stderr}) is available.
\item[\texttt{HAVE\_GETTIMEOFDAY}]
Define if your system provides the \texttt{gettimeofday()} system
call, which is needed to provide microsecond resolution to the
busy callback. If this function is not available, \texttt{time()} is
used.
\end{description}
\subsubsection{Replacement Functions}
The tools library \texttt{fptools} defines many functions that aren't
standard on all systems. Most of them do not differ in behavior from
their originals, but might be slightly slower. But since they are
usually only needed in non-speed-critical sections, the replacements
are used throughout the library. For a full listing of the available
replacement functions, see section \ref{chap-rf}.
However, there are two functions, \texttt{strerror} and
\texttt{tempnam}, that aren't fully implemented. The replacement
\texttt{strerror} does not have a table of error messages and only
produces the error number as string, and the ``fake''
\texttt{tempnam} does not necessarily use a proper temp directory.
Because some functionality is missing, the replacement functions should
\emph{only} be used if the original is not available.
\begin{description}
\item[\texttt{strerror}]
If your system does not provide a \texttt{strerror} function of its
own, define to \texttt{\_FP\_strerror}. This causes the replacement
function to be used throughout the library.
\item[\texttt{tempnam}]
If your system does not provide a \texttt{tempnam} function of its
own, define to \texttt{\_FP\_tempnam}. This causes the replacement
function to be used throughout the library. Must not be defined if the
function is in fact available.
\end{description}
\subsection{Creating the \texttt{Makefile} by hand}
The \texttt{Makefile} is automatically generated by the configuration
script from the template in \texttt{Makefile.in}. This section
explains how the template must be edited into a proper Makefile.
Just copy \texttt{Makefile.in} to \texttt{Makefile} and edit the
place-holders for the following values.
\begin{description}
\item[\texttt{CC}]
Your system's ``C'' compiler.
\item[\texttt{CFLAGS}]
The compilation flags to be passed to the compiler. This must include
``-I.'' so that the include files from the local directory are found,
and ``\mbox{-DHAVE\_CONFIG\_H}'' to declare that a configuration file
is present.
\item[\texttt{RANLIB}]
Set to ``ranlib'' if such a program is available on your system, or to
``:'' (colon) otherwise.
\item[\texttt{VERSION}]
A string holding the release number of the library, currently
``\uuversion{}''
\item[\texttt{PATCH}]
A string holding the patchlevel, currently ``\uupatch{}''.
\end{description}
Some systems do not know Makefiles but offer the concept of a
``project''.\footnote{Actually, most project-oriented systems compile
the project definitions into a Makefile for use by the back-ends.} In
this case, create a new project targeting a library and add all
source codes to the project. Then, make sure that the include path
includes the current directory. Add options to the compiler command
so that the symbol ``HAVE\_CONFIG\_H'' gets defined.
Additionally, the symbol ``VERSION'' must be defined as a
string holding the release number, currently ``\uuversion{}'' and
``PATCH'' must be defined as a string holding the patch level,
currently ``\uupatch{}''.
On 16-bit systems, the package should be compiled using the ``Large''
memory model, so that more than just 64k data space is available.
\subsection{Compiling your Projects}
Compiling the parts of your project that use the functions from the
decoding library is pretty straightforward:
\begin{itemize}
\item All modules that call library functions must include the
\texttt{<uudeview.h>} header file.
\item Optionally, if you want to use the replacement functions to make
your own application more portable, they may also include
\texttt{<fptools.h>}.
\item If your compiler understands about function prototypes, define
the symbol \texttt{PROTOTYPES}. This causes the library functions to
be declared with a full parameter list.
\item Modify the include file search path so that the compiler finds
the include files (usually with the ``-I'' option).
\item Link with the \texttt{libuu.a} library, usually using the
``-luu'' option.
\item Make sure the library is found (usually with the ``-L'' option).
\end{itemize}
\section{Callback Functions}
\subsection{Intro}
At some points, the decoding library offers to call your custom
procedures to do jobs you want to take care of yourself. Some examples
are the ``Message Callback'' to print a message or the ``Busy
Callback'', which is frequently called during lengthy processing
of data to indicate the progress. You can hook up your functions by
calling some library function with a pointer to your function as a
parameter.
In some cases, you will want that one of your functions receives
certain data as a parameter. One reason to achieve this would be
through global data; another possibility is provided through the
passing of an opaque data pointer.
All callback functions are declared to take an additional parameter of
type \texttt{void*}. When hooking up one of your callbacks, you can
specify a value that will passed whenever your function is
called. Since this pointer is never touched by the library, it can be
any kind of data, usually some composed structure. Some application
for the Message Callback might be a \texttt{FILE*} pointer to log the
messages to.
For portability reasons, you should declare your callbacks with the
first parameter actually being a \texttt{void*} pointer and only cast
this pointer to its real type within the function body. This prevents
compiler warnings about the callback setup.
\subsection{Message Callback}
\label{Section-Msg-Callback}
For portability reasons, the library does not assume the availability
of a terminal, so it does not initially know where to print messages
to. The library generates some messages about its progress as well
as more serious warnings and errors. An application should provide a
message callback that displays them. The function might also choose to
ignore informative messages and only display the fatal ones.
A Message Callback takes three parameters. The first one is the opaque
data pointer of type \texttt{void*}. The second one is a text message
of more or less arbitrary length without line breaks. The last
parameter is an indicator of the seriousness of this message. A string
representation of the warning level is also prefixed to the message.
\begin{description}
\item[\texttt{UUMSG\_MESSAGE}]
This is just a plain informative message, nothing important. The
application can choose to simply ignore the message. If a log file
is available, it should be logged, but the message should never result
in a modal dialogue.
\item[\texttt{UUMSG\_NOTE}] ``Note:''
Still an informative message, meaning that the library made a decision
on its own that might interest the user. One example for a note is
that the setuid bit has been stripped from a file mode for security
reasons. Notes are nothing serious and may still be ignored.
\item[\texttt{UUMSG\_WARNING}] ``Warning:''
A warning indicates that a non-serious problem occurred which did not
stop the library from proceeding with the current action. One example
is a temporary file that could not be removed. Warnings should be
displayed, but an application may decide to continue even without user
intervention.
\item[\texttt{UUMSG\_ERROR}] ``ERROR:''
A problem occurred that caused termination of the current request, for
example if the library tried to access a non-existing file. After an
error has occurred, the application should closely examine the
resulting return code of the operation. Error messages are usually
printed in modal dialogues; another option is to save the error
message string somewhere and later print the error message after the
application has examined the operation's return value.
\item[\texttt{UUMSG\_FATAL}] ``Fatal Error:''
This would indicate that a serious problem has occurred that prevents
the library from processing any more requests. Currently unused.
\item[\texttt{UUMSG\_PANIC}] ``Panic:''
Such a message would indicate a panic condition, meaning the
application should terminate without further clean-up handling.
Unused so far.\footnote{It is not intended that this and the previous
error levels will ever be used. Currently, there's no need to include
handling for them.}
\end{description}
\subsection{Busy Callback}
\label{Section-Busy-Callback}
Some library functions, like scanning of an input file or decoding an
output file, can take quite some time. An application will usually
want to inform the user of the progress. A custom ``Busy Callback''
can be provided to take care of this job. This function will then be
called frequently while a large action is being executed within the
library. It is not called when the application itself has control.
Apart from the usual opaque data pointer, the Busy Callback receives a
structure of type \texttt{uuprogress} with the following members:
\begin{description}
\item[\texttt{action}]
What the library is currently doing. One of the following integer
constants:
\begin{description}
\item[\texttt{UUACT\_IDLE}]
The library is idle. This value shouldn't be seen in the Busy
Callback, because the Busy Callback is never called in an idle state.
\item[\texttt{UUACT\_SCANNING}] Scanning an input file.
\item[\texttt{UUACT\_DECODING}] Decoding a file.
\item[\texttt{UUACT\_COPYING}] Copying a file.
\item[\texttt{UUACT\_ENCODING}] Encoding a file.
\end{description}
\item[\texttt{curfile}]
The name of the file we're working on. May include the full
path. Guaranteed to be 256 characters or shorter.
\item[\texttt{partno}]
When decoding a file, this is the current part number we're working
on. May be zero.
\item[\texttt{numparts}]
The maximum part number of this file. Guaranteed to be positive
(non-zero).
\item[\texttt{percent}]
The percentage of the current \emph{part} already processed. The total
percentage can be calculated as $(100*partno-percent)/numparts$.
\item[\texttt{fsize}]
The size of the current file. The percent information is only valid if
this field is \emph{positive}. Whenever the size of a file cannot be
properly determined, this field is set to -1; in this case, the
percent field may hold garbage.
\end{description}
In some cases, it is possible that the percent counter jumps
backwards. This happens seldom enough not to worry about it, but the
callback should take care not to crash in this case.\footnote{This
happens if, in a MIME multipart posting, the final boundary cannot be
found. After searching the boundary until the end-of-file, the scanner
resets itself to the location of the previous boundary.}
The Busy Callback is declared to return an integer value. If a
\emph{non-zero} value is returned, the current operation from
which the callback was called is canceled, which then aborts with
a return value of \texttt{UURET\ush{}CANCEL} (see later).
\subsection{File Callback}
\label{Section-File-Callback}
Input files are usually needed twice, first for scanning and then for
decoding. If the input files are downloaded from a remote server,
perhaps by \emph{NNTP}, they would have to be stored on the local disk
and await further handling. However, the user may choose not to decode
some files after all.
If disk space is important, it is possible to install a ``File
Callback''. When scanning a file, it is assigned an ``Id''. After
scanning has completed, the application can delete the input file. If
it should be required later on for decoding, the File Callback is
called to map the Id back to a filename, possibly retrieving
another copy and disposing of it afterwards.
The File Callback receives four parameters. The first is the opaque
data pointer, the second is the Id that was assigned to the file while
scanning. The fourth parameter is an integer. If it is non-zero, then
the function is supposed to retrieve the file in question, store it on
local disk, and write the resulting filename into the area to which
the third parameter (a \texttt{char*} pointer) points. A fourth
parameter of zero indicates that the decoder is done handling the
file, so that the function can decide whether or not to remove the
file.
The function must return \texttt{UURET\_OK} upon success, or any other
appropriate error code upon failure.
Since it can usually be assumed that disk space is plentily available,
and storing a file is ``cheaper'' than retrieving it twice, this
mechanism has not been used so far.
\subsection{Filename Filter}
\label{Section-FName-Filter}
For portability reasons, the library does not make any assumptions of
the legality of certain filenames. It will pick up a ``garbage'' file
name from the encoded file and happily use it if not told
otherwise. For example, on DOS systems many filenames must be
truncated in order to be valid.
If a ``Filename Filter'' is installed, the library will pass each
potential filename to the filter and then use the filename that the
filter function returns. The filter also has to remove all directory
information from the filename -- the library itself does not know
about directories at all.
The filter function receives the potential filename as string and must
return a pointer to a string with the corrected filename. It may
either return a pointer to some position in the original string or a
pointer to some static area, but it should not modify the source
string.
Two examples of filename filters can be found among the UUDeview
distribution as \texttt{uufnflt.c}. The DOS filter function disposes
directory information, uses only the first 8 characters of the base
filename and the first three characters after the last '.'~(since a
filename might have two extensions). Also, space characters are
replaced by underscores. The Unix filter just returns a pointer to the
filename part of the name (without directory information).
The ``garbage'' filename mentioned above was just for the sake of
argument. It is generally safe to assume that the input filename is
not too weird; after all, it is a filename valid on \emph{some}
system. Still, the user should always be granted the possibility of
renaming a file before decoding it, to allow decoding of files with
insane filenames.
\section{The File List}
\label{file-list}
While scanning the input files, a linked list is built. Each node is
of type \texttt{uulist} and describes one file, possibly composed of
several parts. This section describes the members of the structure
that may be of interest to an application.
\begin{description}
\item[\texttt{state}]
Describes the state of this file. Either the value
\texttt{UUFILE\ush{}READ}\footnote{This value should
only appear internally, never to be seen by an application.} or a
bitfield of the following values:
\begin{description}
\item[\texttt{UUFILE\_MISPART}]
The file is missing at least one part. This bit is set if the part
numbers are non-sequential. Usually results in incorrect decoding.
\item[\texttt{UUFILE\_NOBEGIN}]
No ``begin'' line was detected. Since \emph{Base64}
files do not have begin lines, this bit is never set on them.
For \emph{BinHex} files, the initial colon is used.
\item[\texttt{UUFILE\_NOEND}]
No ``end'' line was detected. Since \emph{Base64}
files do not have end lines, this bit is never set on them. A missing
end on \emph{uuencoded} or \emph{xxencoded} files usually means that
the file is incomplete. For \emph{BinHex}, the trailing colon is
used as end marker.
\item[\texttt{UUFILE\_NODATA}]
No encoded data was found within these parts.
\item[\texttt{UUFILE\_OK}]
This file appears to be okay, and decoding is likely to be successful.
\item[\texttt{UUFILE\_ERROR}]
A decode operation was attempted, but failed, usually because of an
I/O error.
\item[\texttt{UUFILE\_DECODED}]
This file has already been successfully decoded.
\item[\texttt{UUFILE\_TMPFILE}]
The file has been decoded into a temporary file, which can be found
using the \texttt{binfile} member (see below). This flag gets removed
if the temporary file is deleted.
\end{description}
\item[\texttt{mode}]
For \emph{uuencoded} and \emph{xxencoded} files, this is the file mode
found on the ``begin'' line, \emph{Base64} and \emph{BinHex} files
receive a default of 0644. A decode operation will try to restore this
mode.
\item[\texttt{uudet}]
The type of encoding this file uses. May be 0 if
\texttt{UUFILE\ush{}NODATA} or one of the following
values:
\begin{description}
\item[\texttt{UU\_ENCODED}] for \emph{uuencoded} data,
\item[\texttt{B64ENCODED}] for \emph{Base64} encoded data,
\item[\texttt{XX\_ENCODED}] for \emph{xxencoded} data,
\item[\texttt{BH\_ENCODED}] for \emph{BinHex} data,
\item[\texttt{PT\_ENCODED}] for plain-text ``data'', or
\item[\texttt{QT\_ENCODED}] for MIME \emph{quoted-printable} encoded
text.
\end{description}
\item[\texttt{size}]
The approximate size of the resulting file. It is an estimated value
and can be a few percent off the final value, hence the suggestion to
display the size in kilobytes only.
\item[\texttt{filename}]
The filename. For \emph{uuencoded} and \emph{xxencoded} files, it is
extracted from the ``begin'' line. The name of \emph{BinHex} files
is encoded in the first data bytes. \emph{Base64} files have the
filename given in the ``Content-Type'' header. This field may be
\texttt{NULL} if \texttt{state!=UUFILE\ush{}OK}.
\item[\texttt{subfname}]
A unique identifier for this group of parts, usually derived from the
``Subject'' header of each part. It is possible that two
nodes with the same identifier exist in the file list: If a group of
files is considered ``complete'', a new node is opened up for more
parts with the same Id.
\item[\texttt{mimeid}]
Stores the ``id'' field from the ``Content-Type'' information if
available. Actually, this Id is the first choice for grouping of
files, but not surprisingly, non-MIME mails or articles do not have
this information.
\item[\texttt{mimetype}]
Stores this part's ``Content-Type'' if available.
\item[\texttt{binfile}]
After decoding, this is the name of the temporary file the data was
decoded to and stored in. This value is non-NULL if the flag
\texttt{UUFILE\ush{}TMPFILE} is set in the state member above.
\item[\texttt{haveparts}]
The part numbers found for this group of files as a zero-terminated
ordered integer array. Some extra care must be taken, because a file
may have a zeroth part as its first part. Thus if
\texttt{haveparts[0]} is zero, it indicates a zeroth part, and the
list of parts continues. A file may have at most one zeroth part, so
if both \texttt{haveparts[0]} and \texttt{haveparts[1]} are zero, the
zeroth part is the only part of this file.
No more than 256 parts are listed here.
\item[\texttt{misparts}]
Similar to \texttt{haveparts}; a zero-terminated ordered integer array
of missing parts, or simply \texttt{NULL} if no parts are
missing. Since we don't mind if a file doesn't have a zeroth part,
this array does not have the above problems.
\end{description}
\section{Return Values}
Most of the library functions return a value indicating success or the
type of error occurred. The following values can be returned:
\begin{description}
\item[\texttt{UURET\_OK}]
The action completed successfully.
\item[\texttt{UURET\_IOERR}]
An I/O error occurred. There may be many reasons from ``File not
found'' to ``Disk full''. This return code indicates that the
application should consult \texttt{errno} for more information.
\item[\texttt{UURET\_NOMEM}]
A \texttt{malloc()} operation returned \texttt{NULL}, indicating that
memory resources are exhausted. Never seen this one in a VM system.
\item[\texttt{UURET\_ILLVAL}]
You tried to call some operation with invalid parameters.
\item[\texttt{UURET\_NODATA}]
An attempt was made to decode a file, but no encoded data was found
within its parts. Also returned if decoding a \emph{uuencoded} or
\emph{xxencoded} file with missing ``begin'' line.
\item[\texttt{UURET\_NOEND}]
A decoding operation was attempted, but the decoded data didn't have a
proper ``end'' line. A similar condition can also be detected for
\emph{BinHex} files (where the colon is used as end marker).
\item[\texttt{UURET\_UNSUP}]
You tried to encode using an unsupported communications channel, for
example piping to a command on a system without pipes.
\item[\texttt{UURET\_EXISTS}]
The target file already exists (upon decoding), and you didn't allow
to overwrite existing files.
\item[\texttt{UURET\_CONT}]
This is a special return code, indicating that the current operation
must be continued. This return value is used only by two encoding
functions, so see the documentation there.
\item[\texttt{UURET\_CANCEL}]
The current operation was canceled, meaning that the Busy Callback
returned a non-zero value usually because of user request. The library
does not produce this return value on its own, so if your Busy
Callback always returns zero, there's no need to handle this
``Error''.
\end{description}
\section{Options}
\label{Section-Options}
An application program can set and query a number of options. Some of
them are read-only, but others can modify the behavior quite
drastically. Some of them are intended to be set by the end user via
an options menu.
\begin{description}
\item[\texttt{UUOPT\_VERSION}] {\small (string, read-only)} \\
Retrieves the full version number of the library, composed as
\emph{MA\-JOR}.\emph{MI\-NOR}\discretionary{}{}{}pl\emph{PATCH}
(the major and minor version
numbers and the patchlevel are integers).
\item[\texttt{UUOPT\_FAST}] {\small (integer, default=0)} \\
If set to 1, the library will assume that each input file consists of
exactly one email message or newsgroup posting. After finding encoded
data within a file, the scanner will not continue to look for more
data below. This strategy can save a lot of time, but has the drawback
that files also cannot be checked for completeness -- since the
scanner does not look for ``end'' lines, we don't notice them missing.
This flag does not have any effect on MIME multipart messages, which
are always scanned to the end (alas, the Epilogue will be skipped).
Actually, with this flag set, the scanner becomes more MIME-compliant.
\item[\texttt{UUOPT\_DUMBNESS}] {\small (integer, default=0)} \\
As already mentioned, the library evaluates
information found in the part's ``Subject'' header line if
available. The heuristics here are versatile, but cannot be guaranteed
to be completely failure-proof. If false information is derived, the
parts will be ordered and grouped wrong, resulting in wrong decoding.
If the ``dumbness'' is set to 1, the code to derive a part number is
disabled; it will then be assumed that all parts within a group appear
in correct order: the first one is assigned number 1 etc. However,
part numbers found in MIME-headers are still used (I haven't yet found
a file where these were wrong).
A dumbness of 2 also switches off the code to select a unique
identifier from the subject line. This does still work with
single-part files\footnote{Of course, this option wouldn't make sense
with single-part files, since there's no ``grouping'' involved that
might fail.} and \emph{might} work with multi-part files, as long as
they're in correct order and not mixed. The filename is found on
the first part and then passed on to the following parts.
This option only takes effect for files scanned afterwards.
\item[\texttt{UUOPT\_BRACKPOL}] {\small (integer, default=0)} \\
Series of multi-part postings on the Usenet usually have subject lines
like ``You must see this! [1/3] (2/4)''. How to parse this
information? Is this the second part of four in a series of three
postings, or is it the first of three parts and the second in a series
of four postings? The library cannot know, and simply gives numbers in
() parentheses precedence over number in [] brackets. If this
assumption fails, the parts will be grouped and ordered completely
wrong.
Setting the ``bracket policy'' to 1 changes this precedence.
If now both parentheses and brackets are present, the
numbers within brackets will be evaluated first.
This option only takes effect for files scanned afterwards.
\item[\texttt{UUOPT\_VERBOSE}] {\small (integer, default=1)} \\
If set to 0, the Message Callback will not be bothered with messages
of level
\texttt{UUMSG\ush{}MESSAGE} or
\texttt{UUMSG\ush{}NOTE}.
The default is to generate these messages.
\item[\texttt{UUOPT\_DESPERATE}] {\small (integer, default=0)} \\
By default, the library refuses to decode incomplete files and
generates errors. But if switched into ``desperate mode'' these kinds
of errors are ignored, and all \emph{available} data is decoded.
The usefulness of the resulting corrupt file depends on the type of
the file.
\item[\texttt{UUOPT\_IGNREPLY}] {\small (integer, default=0)} \\
If set to 1, the library will ignore email messages and news postings
which were sent as ``Reply'', since they are less likely to feature
useful data. There's no real reason to turn on this option any more
(earlier versions got easily confused by replies).
\item[\texttt{UUOPT\_OVERWRITE}] {\small (integer, default=1)} \\
When the decoder finds that the target file already exists, it is
simply overwritten silently by default. If this option is set to 0,
the decoder fails instead, generating a
\texttt{UURET\ush{}EXIST} error.
\item[\texttt{UUOPT\_SAVEPATH}] {\small (string, default=(empty))} \\
Without setting this option, files are decoded to the current
directory. This ``save path'' is handled as prefix to each
filename. Because the library does not know about directory layouts,
the resulting filename is simply the concatenation of the save path
and the target file, meaning that the path must include a final
directory separator (slash, backslash, or whatever).
\item[\texttt{UUOPT\_IGNMODE}] {\small (integer, default=0)} \\
Usually, the decoder tries to restore the file mode found on the
``begin'' line of \emph{uuencoded} and \emph{xxencoded} files. This is
turned off if this option is set to 1.
\item[\texttt{UUOPT\_DEBUG}] {\small (integer, default=0)} \\
If set to 1, all messages will be prefixed with the exact sourcecode
location (filename and line number) where they were created. Might be
useful if this is not clear from context.
\item[\texttt{UUOPT\_ERRNO}] {\small (integer, read-only)} \\
This ``option'' can be queried after an operation failed with
\texttt{UURET\ush{}IOERR} and returns the
\texttt{errno} value that originally caused the problem. The ``real''
value of this variable might already be obscured by secondary
problems.
\item[\texttt{UUOPT\_PROGRESS}] {\small (uuprogress, read-only)} \\
Returns the progress structure. This would only make sense in
multi-threaded environments where the decoder runs in one thread and
is controlled from another. Although some care is taken while updating
the structure's values, there might still be synchronization problems.
\item[\texttt{UUOPT\_USETEXT}] {\small (integer, default=0)} \\
If this flag is true, plain text files will be presented for
``decoding''. This includes non-decodeable messages as well as
plain-text parts from MIME multipart messages. Since they usually
don't have associated filenames, a unique name will be created from a
sequential four-digit number.
\item[\texttt{UUOPT\_PREAMB}] {\small (integer, default=0)} \\
Whether to use the plain-text preamble and epilogue from MIME
multipart messages. The standard defines they're supposed to
be ignored, so there's no real reason to set this option.
\item[\texttt{UUOPT\_TINYB64}] {\small (integer, default=0)} \\
Support for tiny Base64 data.
If set to off, the scanner does not recognize stand-alone Base64
encoded data with less than 3 lines. The problem is that in some
cases plain text might be misinterpreted as Base64 data, since,
for example, any four-character alphanumerical string like ``Argh''
appearing on a line of its own is valid Base64 data. Since encoded
files are usually longer, and there is considerable confusion about
erroneous Base64 detection, this option is off by default. There's
probably no need to present this option separately to the user. It's
reasonable to associate it with the ``desperate mode'' described
above.
Note that this option only affects \emph{stand-alone} data. Input
from Mime messages with the encoding type correctly specified in
the ``Content-Transfer-Encoding'' header is always evaluated.
There is also no problem with encoding types different than Base64,
since they have an explicit notion of the beginning and end of a
file, and no danger of misinterpretation exists.
\item[\texttt{UUOPT\_ENCEXT}] {\small (string, default=(empty))} \\
When encoding into a file on the local disk, the target files
usually receive an extension composed of the three-digit part
number. This may be considered inappropriate for single-part files.
If this option is set, its value is attached to the base file name as
extension for the target file. A dot `.' is inserted automatically.
When using uuencoding, a sensible value might be ``uue''.
This option does not alter the behaviour on multi-part files, where
the individual parts always receive the three-digit part number as
extension.
\end{description}
\section{General Functions}
After describing all the framework in the previous chapters, it is
time to mention some function calls. Still, the functions presented
here don't actually \emph{do} anything, they just query and modify the
behavior of the core functions.
\begin{description}
\item[\texttt{int UUInitialize (void)}] \hfill{} \\
This function initializes the library and must be called before any
other decoding or encoding function. During initialization, several
arrays are allocated. If memory is exhausted,
\texttt{UURET\ush{}NOMEM} is returned, otherwise the initialization
will return successfully with \texttt{UURET\ush{}OK}.
\item[\texttt{int UUCleanUp (void)}] \hfill{} \\
Cleans up all resources that have been allocated during a program run:
memory structures, temporary files and everything. No library function
may be called afterwards, with the exception of \texttt{UUInitialize}
to start another run.
\item[\texttt{int UUGetOption (int opt, int *ival, char *cval, int len)}] \hfill{} \\
Retrieves the configuration option (see section \ref{Section-Options})
opt. If the option is integer, it is stored in \texttt{ival} (only if
\texttt{ival!=NULL}) and also returned as return value. String options
are copied to \texttt{cval}. Including the final nullbyte, at most
\texttt{len} characters are written to \texttt{cval}. If the progress
information is queried with
\texttt{UUOPT\ush{}PROGRESS}, \texttt{cval} must
point to a \texttt{uuprogress} structure and \texttt{len} must equal
\texttt{sizeof(uuprogress)}.
For integer options, \texttt{cval} may be NULL and \texttt{len} 0 and
vice versa: for string options, \texttt{ival} is not evaluated.
\item[\texttt{int UUSetOption (int opt, int ival, char *cval)}] \hfill{} \\
Sets one of the configuration options. Integer options are set via
\texttt{ival} (\texttt{cval} may be \texttt{NULL}), and string options
are copied from the null-ter\-mina\-ted string \texttt{cval}
(\texttt{ival} may be 0). Returns
\texttt{UURET\ush{}ILLVAL} if you try to set a
read-only value, or \texttt{UURET\_OK} otherwise.
\item[\texttt{char *UUstrerror (int errcode)}] \hfill{} \\
Maps the return values \texttt{UURET\_*} into error messages:
\begin{description}
\item[\texttt{UURET\_OK}] ``OK''
\item[\texttt{UURET\_IOERR}] ``File I/O Error''
\item[\texttt{UURET\_NOMEM}] ``Not Enough Memory''
\item[\texttt{UURET\_ILLVAL}] ``Illegal Value''
\item[\texttt{UURET\_NODATA}] ``No Data found''
\item[\texttt{UURET\_NOEND}] ``Unexpected End of File''
\item[\texttt{UURET\_UNSUP}] ``Unsupported function''
\item[\texttt{UURET\_EXISTS}] ``File exists''
\end{description}
\item[\texttt{int UUSetMsgCallback (void *opaque, void (*func) ())}] \hfill{} \\
Sets the Message Callback function to \texttt{func} (see section
\ref{Section-Msg-Callback}). \texttt{opaque} is the opaque data
pointer that is passed untouched to the callback whenever it is
called. To prevent compiler warnings, a prototype of the callback
should appear before this line. Always returns
\texttt{UURET\ush{}OK}. If \texttt{func==NULL}, the callback is
disabled.
\item[\texttt{int UUSetBusyCallback (void *, void (*func) (), long msecs)}] \hfill{} \\
Sets the Busy Callback function to \texttt{func} (see section
\ref{Section-Busy-Callback}). \texttt{msecs} gives a timespan in
milliseconds; the library will try to call the callback after this
timespan has passed. On some systems, the time can only be queried
with second resolution -- in that case, timing will be quite
inaccurate. The semantics for the other two parameters are the same as
in the previous function. If \texttt{func==NULL}, the busy callback is
disabled.
\item[\texttt{int UUSetFileCallback (void *opaque, int (*func) ())}] \hfill{} \\
Sets the File Callback function to \texttt{func} (see section
\ref{Section-File-Callback}). Semantics identical to the previous
two functions. There is no need to install a file callback if this
feature isn't used.
\item[\texttt{int UUSetFNameFilter (void *opaque, char * (*func) ())}] \hfill{} \\
Sets the Filename Filter function to \texttt{func} (see section
\ref{Section-FName-Filter}). Semantics identical to the previous
three functions. If no filename filter is installed, any filename is
accepted. This may result in failures to write a file because of an
invalid filename.
\item[\texttt{char * UUFNameFilter (char *fname)}] \hfill{} \\
Calls the current filename filter on \texttt{fname}. This function is
provided so that certain parts of applications do not need to know
which filter is currently installed. This is handy for applications
that are supposed to run on more than one system. If no filename
filter is installed, the string itself is returned. Since a filename
filter may return a pointer to static memory or a pointer into the
parameter, the result from this function must not be written to.
\end{description}
\section{Decoding Functions}
Now for the more useful functions. The functions within this section
are everything you need to scan and decode files.
\begin{description}
\item[\texttt{int UULoadFile (char *fname, char *id, int delflag)}] \hfill{} \\
Scans a file for encoded data and inserts the result into the file
list. Each input file must only be scanned once; it may contain many
parts as well as multiple encoded files, thus it is possible that many
decodeable files are found after scanning one input file. On the other
hand it is also possible that \emph{no} decodeable data is
found. There is no limit to the number of files.\footnote{Strictly
speaking, the memory is of course limited. But try to fill a sensible
amount with structures in the 100-byte region.}
If \texttt{id} is non-NULL, its value is used instead of the filename,
and the file callback is used to map the id back into a filename
whenever this input file is needed again. If \texttt{id} \emph{is}
\texttt{NULL}, then the input file must not be deleted or modified
until \texttt{UUCleanUp} has been called.
If \texttt{delflag} is non-zero, the input file will automatically be
removed within \texttt{UUCleanUp}. This is useful when the decoder's
input are also temporary files -- this way, the application can forget
about them right after they're ``loaded''. The value of
\texttt{delflag} is ignored, however, if \texttt{id} is non-NULL;
combining both options does not make sense.
The behavior of this function is influenced by some of the options,
most notably \texttt{UUOPT\ush{}FAST}. The two most
probable return values are \texttt{UURET\ush{}OK}, indicating
successful completion, or \texttt{UURET\ush{}IOERR} in case of some
error while reading the file. The other return values are less likely
to appear.
Note that files are even scheduled for destruction if an error
\emph{did} happen during scanning (with the exception of a file that
could not be opened). But error handling is slightly problematic here
anyway, since it might be possible that useful data was found before
the error occurred.
\item[\texttt{uulist * UUGetFileListItem (int num)}] \hfill{} \\
Returns a pointer to the \texttt{num}th item of the file list. The
elements of this structure are described in section \ref{file-list}.
The list is zero-based. If \texttt{num} is out-of-range, \texttt{NULL}
is returned. Usage of this function is pretty straightforward: loop
with an increasing value until \texttt{NULL} is returned. The
structure must not be modified by the application itself. Also, none
of the structure's value should be ``cached'' elsewhere, as they are
not constant: they may change after each loaded file.
\item[\texttt{int UURenameFile (uulist *item, char *newname)}] \hfill{} \\
Renames one item of the file list. The old name is discarded and
replaced by \texttt{newname}. The new name is copied and may thus
point to volatile memory. The name should be a local filename without
any directory information, which would be stripped by the filename
filter anyway.
\item[\texttt{int UUDecodeToTemp (uulist *item)}] \hfill{} \\
Decodes the given item of the file list and places the decoded output
into a temporary file. This is intended to allow ``previews'' of an
encoded file without copying it to its final location (which would
probably overwrite other files). The name of the temporary file can be
retrieved afterwards by re-retrieving the node of the file list and
looking at its \texttt{binfile} member.
\texttt{UURET\ush{}OK} is returned upon successful completion. Most
other error codes can occur, too. \texttt{UURET\ush{}NODATA} is
returned if you try to decode parts without encoded data or with a
missing beginning (\emph{uuencoded} and \emph{xxencoded} files only)
-- of course, this condition would also have been obvious from the
\texttt{state} value of the file list structure.
The setting of \texttt{UUOPT\ush{}DESPERATE} changes the behavior if
an unexpected end of file was found (usually meaning that one or more
parts are missing). Normally, the partially-written target file is
removed and the value \texttt{UURET\ush{}NOEND} is returned. In
desperate mode, the same error code is returned, but the target file
is not removed.
The target file is removed in all other error conditions.
\item[\texttt{int UURemoveTemp (uulist *item)}] \hfill{} \\
After a file has been decoded into a temporary file and is needed no
longer, this function can be called to free the disk space immediately
instead of having to wait until \texttt{UUCleanUp}. If a decode
operation is called for later on, the file will simply be recreated.
\item[\texttt{int UUDecodeFile (uulist *item, char *target)}] \hfill{} \\
This is the function you have been waiting for. The file is decoded
and copied to its final location. Calling \texttt{UUDecodeToTemp}
beforehand is not required. If \texttt{target} is non-NULL, then it is
immediately used as filename for the target file (without prepending
the save path and without passing it through the filename
filter). Otherwise, if \texttt{target==NULL}, the final filename is
composed by concatenating the save path and the result of the filename
filter used upon the filename found in the encoded file.
If the target file already exists, the value of the
\texttt{UUOPT\ush{}OVERWRITE} option is checked. If it is false
(zero), then the error \texttt{UURET\ush{}EXISTS} is generated and
decoding fails. If the option is true, the target file is silently
overwritten.\footnote{If we don't have permission to overwrite the
target file, an I/O error is generated.}
The file is first decoded into a temporary file, then the temporary
file is copied to the final location. This is done to prevent
overwriting target files with data that turns out too late to be
invalid.
\item[\texttt{int UUInfoFile (uulist *item, void *opaque, int (*func) ())}] \hfill{} \\
This function can be used to query information about the encoded
file. This is either the zeroth part of a file if available, or the
beginning of the first part up to the encoded data otherwise. Once
again, a callback function is used to do the job. \texttt{func} must
be a function with two parameters. The first one is an opaque data
pointer (the value of \texttt{opaque}), the other is one line of info
about the file (at maximum, 512 bytes). The callback is called for
each line of info.
The callback can return either zero, meaning that it can accept more
data, or non-zero, which immediately stops retrieval of more
information.
Usually, the opaque pointer holds some information about a text
window, so that the callback knows where to print the next line. In
a terminal-oriented application, the user can be queried each 25th
line and the callback can return non-zero if the user doesn't wish to
continue.
\item[\texttt{int UUSmerge (int pass)}] \hfill{} \\
Attempts a ``Smart Merge'' of parts that seem to belong to different
files but which \emph{could} belong to the same. Occasionally, you
will find a posting with parts 1 to 3 and 5 to 8 of ``picture.gif''
and part 4 of ``picure.gif'' (note the spelling). To the human, it is
obvious that these parts belong together, to a machine, it is
not. This function attempts to detect these conditions and merge the
appropriate parts together. This function must be called repeatedly
with increasing values for ``pass'': With \texttt{pass==0}, only
immediate fits are merged, increasing values allow greater
``distances'' between part numbers,
This function is a bunch of heuristics, and I don't really trust
them. In some cases, the ``smart'' merge may do more harm than
good. This function should only be called as last resort on explicit
user request. The first call should be made with \texttt{pass==0},
then with \texttt{pass==1} and at last with \texttt{pass=99}.
\end{description}
\section{Encoding Functions}
There are a couple of functions to encode data into a file. You will
usually need no more than one of them, depending on the job you want
to do. The functions also differ in the headers they generate. Some
functions do generate full MIME-compliant headers. This may sound like
the best choice, but it's not always the wisest choice. Please follow
the following guidelines.
\begin{itemize}
\item
Do not produce MIME-compliant messages if you cannot guarantee their
proper handling. For example, if you create a MIME-compliant message
on disk, and the user \emph{includes} this file in a text message, the
headers produced for the encoded data become not part of the final
message's header but are just included in the message body. The
resulting message will \emph{not} be MIME-compliant!
\item
Take it from the author that slightly-different-than-MIME messages
give the recipient much worse headaches than messages that do not try
to be MIME in the first place.
\item
Because of that, headers should \emph{only} be generated if the
application itself handles the final mailing or posting of the
message. Do not rely on user actions.
\item
Do not encode to \emph{Base64} outside of MIME messages. Because some
information like the filename is only available in the MIME-message
framework, \emph{Base64} doesn't make much sense without it.
\item
However, if you can guarantee proper MIME handling, \emph{Base64}
should be favored above the other types of encoding. Most
MIME-compliant applications do not know the other encoding types.
\end{itemize}
All of the functions have a bunch of parameters for greater
flexibility. Don't be confused by their number, usually you'll need to
fill only a few of them. There's a number of common parameters which
can be explained separately:
\begin{description}
\item[\texttt{FILE *outfile}] \hfill{} \\
The output stream, where the encoded data is written to.
\item[\texttt{FILE *infile, char *infname}] \hfill{} \\
Where the input data shall be read from. Only one of both values must
be specified, the other can be NULL.
\item[\texttt{char *outfname}] \hfill{} \\
The name by which the recipient will receive the file. It is used on
the ``begin'' line for \emph{uuencoded} and \emph{xxencoded} data, and
in the headers of MIME-formatted messages. If this parameter is NULL,
it defaults to \texttt{infname}. It must be specified if data is read
from a stream and \texttt{infname==NULL}.
\item[\texttt{int filemode}] \hfill{} \\
For \emph{uuencoded} and \emph{xxencoded} data, the file permissions
are encoded into the ``begin'' line. This mode can be specified
here. If the value is 0, it will be determined by performing a
\texttt{stat()} call on the input file. If this call should fail, a
value of 0644 is used as default.
\item[\texttt{int encoding}] \hfill{} \\
The encoding to use. One of the three constants \texttt{UU\ush{}ENCODED},
\texttt{XX\ush{}ENCODED} or \texttt{B64\-ENCODED}.
\end{description}
Now for the functions \dots{}
\begin{description}
\item[\texttt{\begin{tabular}{ll}%
int UUEncodeMulti & (FILE *outfile, FILE *infile, \\
& ~char *infname, int encoding, \\
& ~char *outfname, char *mimetype, \\
& ~int filemode) \\
\end{tabular}}] \hfill{} \\
Encodes data into a subpart of a MIME ``multipart'' message.
Appropriate ``Content-Type'' headers are produced, followed by
the encoded data. The application must provide the envelope and
boundary lines. If \texttt{mimetype!=NULL}, it is used as value
for the ``Content-Type'' field, otherwise, the extension from
\texttt{outfname} or \texttt{infname} (if \texttt{outfname==NULL})
is used to look up the relevant type name.
\item[\texttt{\begin{tabular}{ll}%
int UUEncodePartial & (FILE *outfile, FILE *infile, \\
& ~char *infname, int encoding, \\
& ~char *outfname, char *mimetype, \\
& ~int filemode, int partno, \\
& ~long linperfile) \\
\end{tabular}}] \hfill{} \\
Encodes data as the body of a MIME ``message/partial'' message. This
type allows message fragmentation. This function must be called
repetitively until it runs out of input data. The application must
provide a valid envelope with a ``message/partial'' content type and
proper information about the part numbers.
Each call produces \texttt{linperfile} lines of encoded output. For
\emph{uuencoded} and \emph{xxencoded} files, each output line encodes
45 bytes of input data, each \emph{Base64} line encodes 57 bytes.
If \texttt{linperfile==0}, this function is equivalent to
\texttt{UUEncodeMulti}.
Different handling is necessary when reading from an input stream
(if \texttt{infile!=NULL}) compared to reading from a file
(if \texttt{infname!=NULL}). In the first case, the function must be
called until \texttt{feof()} becomes true on the input file, or an
error occurs. In the second case, the file will be opened
internally. Instead of \texttt{UURET\ush{}OK}, a value of
\texttt{UURET\ush{}CONT} is returned for all but the last part.
\item[\texttt{\begin{tabular}{ll}%
int UUEncodeToStream & (FILE *outfile, FILE *infile, \\
& ~char *infname, int encoding, \\
& ~char *outfname, int filemode) \\
\end{tabular}}] \hfill{} \\
Encodes the input data and sends the plain output without any
headers to the output stream. Be aware that for \emph{Base64}, the
output does not include any information about the filename.
\item[\texttt{\begin{tabular}{ll}%
int UUEncodeToFile & (FILE *infile, char *infname, \\
& ~int encoding, char *outfname, \\
& ~char *diskname, long linperfile) \\
\end{tabular}}] \hfill{} \\
Encodes the input data and writes the output into one or more output
files on the local disk. No headers are generated. If
\texttt{diskname==NULL}, the names of the encoded files are generated
by concatenating the save path (see the \texttt{UUOPT\ush{}SAVEPATH}
option) and the base name of \texttt{outfname} or \texttt{infname}
(if \texttt{outfname==NULL}).
If \texttt{diskname!=NULL} and does not contain directory information,
the target filename is the concatenation of the save path and
\texttt{diskname}. If \texttt{diskname} is an absolute path name, it
is used itself.
From the so-generated target filename, the extension is stripped. For
single-part output files, the extension set with the
\texttt{UUOPT\ush{}ENCEXT} option is used. Otherwise, the three-digit
part number is used as extension. If the destination file does already
exist, the value of the \texttt{UUOPT\ush{}OVERWRITE} is checked; if
overwriting is not allowed, encoding fails with
\texttt{UURET\ush{}EXISTS}.
\item[\texttt{\begin{tabular}{ll}%
int UUE\_PrepSingle & (FILE *outfile, FILE *infile, \\
& ~char *infname, int encoding, \\
& ~char *outfname, int filemode, \\
& ~char *destination, char *from, \\
& ~char *subject, int isemail) \\
\end{tabular}}] \hfill{} \\
Produces a complete MIME-formatted message including all necessary
headers. The output from this function is usually fed directly into a
mail delivery agent which honors headers (like ``sendmail'' or
``inews'').
If \texttt{from!=NULL}, it is sent as the sender's email address
in the ``From'' header field. Some MDA programs are able to provide
the sender's address themselves, so this value may be NULL in certain
cases.
If \texttt{subject!=NULL}, the text is included in the ``Subject''
header field. The subject is extended with information about the file
name and part number (in this case, always ``(001/001)'').
``Destination'' must not be NULL. Depending on the ``isemail'' flag,
its contents are sent either in the ``To'' or ``Newsgroups'' header
field.
\item[\texttt{\begin{tabular}{ll}%
int UUE\_PrepPartial & (FILE *outfile, FILE *infile, \\
& ~char *infname, int encoding, \\
& ~char *outfname, int filemode, \\
& ~int partno, long linperfile, \\
& ~long filesize, \\
& ~char *destination, char *from, \\
& ~char *subject, int isemail) \\
\end{tabular}}] \hfill{} \\
Similar to \texttt{UUE\_PrepSingle}, but produces a complete
MIME-formatted ``message/partial'' message including all necessary
headers. The function must be called repetitively until it runs
out of input data. For more explanations, see the description of the
function \texttt{UUEncodePartial} above.
The only additional parameter is \texttt{filesize}. Usually, this
value can be 0, as the size of the input file can usually be
determined by performing a \texttt{stat()} call. However, this might
not be possible if \texttt{infile} refers to a pipe. In that case, the
value of \texttt{filesize} is used.
If the size of the input data cannot be determined, and
\texttt{filesize} is 0, the function refuses encoding into multiple
files and produces only a single stream of output.
If data is read from a file instead from a stream
(\texttt{infile==NULL}), the function opens the file internally and
returns \texttt{UURET\ush{}CONT} instead of \texttt{UURET\ush{}OK} on
successful completion for all but the last part.
\end{description}
\section{The Trivial Decoder}
In this section, we implement and discuss the ``Trivial Decoder'',
which illustrates the use of the decoding functions. We start with the
absolute minimum and then add more features and actually end up with a
limited, but useful tool. For a full-scale frontend, look at the
implementation of the ``UUDeview'' program. The sample code can be
found among the documentation files as \texttt{\mbox{td-v1.c}},
\texttt{\mbox{td-v2.c}} and \texttt{\mbox{td-v3.c}}.
\subsection{Version 1}
\begin{figure}
\centering
\begin{small}
\rule{\textwidth}{1pt}
\begin{verbatim}
#include <stdio.h>
#include <stdlib.h>
#include <config.h>
#include <uudeview.h>
int main (int argc, char *argv[])
{
UUInitialize ();
UULoadFile (argv[1], NULL, 0);
UUDecodeFile (UUGetFileListItem (0), NULL);
UUCleanUp ();
return 0;
}
\end{verbatim}
\rule{\textwidth}{1pt}
\end{small}
\caption{The ``Trivial Decoder'', Version 1}
\label{td-v1}
\end{figure}
The minimal decoding program is displayed in Figure \ref{td-v1}. Only
four code lines are needed for the implementation. \texttt{<stdlib.h>}
defines \texttt{NULL}, \texttt{<uudeview.h>} declares the decoding
library functions, and \texttt{<config.h>}, the library's
configuration file, is needed for some configuration
details\footnote{Actually, only the definition of \texttt{UUEXPORT}
is needed. You could omit \texttt{<config.h>} and define this value
elsewhere, for example in the project definitions.}.
After initialization, the file given as first command line parameter
is scanned. No symbolic name is assigned to the file, so that we don't
need a file callback. After the scanning, the encoded file is decoded
and stored in the current directory by its native name.
Of course, there is much to complain about:
\begin{itemize}
\item No error checking is done. For example, does the input file exist?
\item Only a single file can be scanned for encoded data.
\item If more than one encoded file is found, only the first one is
decoded, the others are ignored.
\item No checking is done if there actually \emph{is} encoded data in
the file and whether this data is valid.
\end{itemize}
\subsection{Version 2}
\begin{figure}
\centering
\begin{small}
\rule{\textwidth}{1pt}
\begin{verbatim}
#include <stdio.h>
#include <string.h>
#include <errno.h>
#include <stdlib.h>
#include <config.h>
#include <uudeview.h>
int main (int argc, char *argv[])
{
uulist *item;
int i, res;
UUInitialize ();
for (i=1; i<argc; i++)
if ((res = UULoadFile (argv[i], NULL, 0)) != UURET_OK)
fprintf (stderr, "could not load %s: %s\n",
argv[i], (res==UURET_IOERR) ?
strerror (UUGetOption (UUOPT_ERRNO, NULL, NULL, 0)) :
UUstrerror(res));
for (i=0; (item=UUGetFileListItem(i)) != NULL; i++) {
if ((item->state & UUFILE_OK) == 0)
continue;
if ((res = UUDecodeFile (item, NULL)) != UURET_OK) {
fprintf (stderr, "error decoding %s: %s\n",
(item->filename==NULL)?"oops":item->filename,
(res==UURET_IOERR) ?
strerror (UUGetOption (UUOPT_ERRNO, NULL, NULL, 0)) :
UUstrerror(res));
}
else {
printf ("successfully decoded '%s'\n", item->filename);
}
}
UUCleanUp ();
return 0;
}
\end{verbatim}
\rule{\textwidth}{1pt}
\end{small}
\caption{The ``Trivial Decoder'', Version 2}
\label{td-v2}
\end{figure}
The second version, printed in figure \ref{td-v2}, addresses all of
the above problems. The code size more than tripled, but that's
largely because of the error messages.
All files given on the command
line are scanned\footnote{With Microsoft compilers on MS-DOS systems,
don't forget to link with \texttt{setargv.obj} to properly handle
wildcards}, and all encoded files are decoded. Of course, it is now
also possible for an encoded file to span its parts over more than one
input file. Appropriate error messages are printed upon failure of any
step, and a success message is printed for successfully decoded files.
Apart from the program's unfriendliness that there is no
user-interaction like selective decoding of files, choice of a target
directory etc., there are only three more items to complain about:
\begin{itemize}
\item Errors and other messages produced within the library aren't
displayed because there's no message callback.
\item No filename filter is installed, so decoding of files with
invalid filenames will fail; this especially includes filenames
with directory information.
\item No information is printed for invalid encoded files, or files
with missing parts (they're simply skipped).
\end{itemize}
\subsection{Version 3}
\begin{figure}
\centering
\begin{small}
\rule{\textwidth}{1pt}
{\small\emph{\dots{} right after the \#includes}} \\
\begin{verbatim}
#include <fptools.h>
void MsgCallBack (void *opaque, char *msg, int level)
{
fprintf (stderr, "%s\n", msg);
}
char * FNameFilter (void *opaque, char *fname)
{
static char dname[13];
char *p1, *p2;
int i;
if ((p1 = _FP_strrchr (fname, '/')) == NULL)
p1 = fname;
if ((p2 = _FP_strrchr (p1, '\\')) == NULL)
p2 = p1;
for (i=0, p1=dname; *p2 && *p2!='.' && i<8; i++)
*p1++ = (*p2==' ')?(p2++,'_'):*p2++;
while (*p2 && *p2 != '.') p2++;
if ((*p1++ = *p2++) == '.')
for (i=0; *p2 && *p2!='.' && i<3; i++)
*p1++ = (*p2==' ')?(p2++,'_'):*p2++;
*p1 = '\0';
return dname;
}
\end{verbatim}
{\small\emph{\dots{} within \texttt{main()} after \texttt{UUInitialize}}} \\
\begin{verbatim}
UUSetMsgCallback (NULL, MsgCallBack);
UUSetFNameFilter (NULL, FNameFilter);
\end{verbatim}
{\small\emph{\dots{} replacing the main loop's \emph{else}}} \\
\begin{verbatim}
else {
printf ("successfully decoded '%s' as '%s'\n",
item->filename,
UUFNameFilter (item->filename));
}
\end{verbatim}
\rule{\textwidth}{1pt}
\end{small}
\caption{Changes for Version 3}
\label{td-v3-diff}
\end{figure}
This last section adds a simple filename filter (targeting at a DOS
system with 8.3 filenames) and a simple
message callback, which just dumps messages to the console. Figure
\ref{td-v3-diff} lists the changes with respect to version 2 (for the
full listing, refer to the source file on disk).
The message callback, a one-liner, couldn't be simpler. The filename
filter will probably not win an award for good programming style, but
it does its job of stripping Unix-style or DOS-style directory names
and using only the first 8 characters of the base filename and the
first three characters of the extension. If the filename contains
space characters, they're replaced by underscores. Note that
\texttt{dname}, the storage for the resulting filename, is declared
static, as it must be accessible after the filter function has
returned.
For portability, the filename filter uses a replacement function from
the \texttt{fptools} library instead of relying of a native implementation
of the \texttt{strrchr} function.
Both callbacks are installed right after initializing the
library. Since now the filename of the decoded file may be
different from the filename of the file list structure, we recreate
the resulting filename by calling the filename filter ourselves for
display, so that the user knows where to look for the file.
\section{Replacement functions}
\label{chap-rf}
This section is a short reference for the replacement functions from
the \texttt{fptools} library. Some of them may be useful in the
application code as well. Most of these functions are pretty standard
in modern systems, but there's also a few from the author's
imagination. Each of the functions is tagged with information why this
replacement exists:
\begin{itemize}
\item ``nonstandard'' (ns): this function is available on some systems, but
not on others. Functions with this tag could be safely replaced with a
native implementation.
\item ``feature'' (f): the replacement adds some functionality with
respect to the ``original''.
\item ``author''(a): just a function the author considered useful.
\end{itemize}
\begin{description}
\item[\texttt{void \_FP\_free (void *)}] {\small (f)} \\
ANSI C guarantees that \texttt{free()} can be safely called with a
\texttt{NULL} argument, but some old systems dump core. This
replacement just ignores a \texttt{NULL} pointer and passes anything
else to the original \texttt{free()}.
\item[\texttt{char *\_FP\_strdup (char *ptr)}] {\small (ns)} \\
Allocates new storage for the string \texttt{ptr} and copies the
string including the final nullbyte to the new location (thus
``duplicating'' the string). Returns \texttt{NULL} if the
\texttt{malloc()} call fails.
\item[\texttt{char *\_FP\_strncpy (char *dest, char *src, int count)}] {\small (f)} \\
Copies text from the \texttt{src} area to the \texttt{dest} area,
until either a nullbyte has been copied or \texttt{count} bytes have
been copied. Differs from the original in that if \texttt{src} is
longer than \texttt{count} bytes, then only \texttt{count}-1 bytes are
copied, and the destination area is properly terminated with a
nullbyte.
\item[\texttt{void *\_FP\_memdup (void *ptr, int count)}] {\small (a)} \\
Allocates a new area of \texttt{count} bytes, which are then copied
from the \texttt{ptr} area.
\item[\texttt{int \_FP\_stricmp (char *str1, char *str2)}] {\small (ns)} \\
Case-insensitive equivalent of \texttt{strcmp}.
\item[\texttt{int \_FP\_strnicmp (char *str1, char *str2, int count)}] {\small (ns)} \\
Case-insensitive equivalent of \texttt{strncmp}.
\item[\texttt{char *\_FP\_strrchr (char *string, int chr)}] {\small (ns)} \\
Similar to \texttt{strchr}, but returns a pointer to the last
occurrence of the character \texttt{chr} in \texttt{string}.
\item[\texttt{char *\_FP\_strstr (char *str1, char *str2)}] {\small (ns)} \\
Returns a pointer to the first occurrence of \texttt{str2} in
\texttt{str1} or \texttt{NULL} if the second string does not appear
within the first.
\item[\texttt{char *\_FP\_strrstr (char *str1, char *str2)}] {\small (ns)} \\
Similar to \texttt{strstr}, but returns a pointer to the last
occurrence of \texttt{str2} in \texttt{str1}.
\item[\texttt{char *\_FP\_stristr (char *str1, char *str2)}] {\small (a)} \\
Case-insensitive equivalent of \texttt{strstr}.
\item[\texttt{char *\_FP\_strirstr (char *str1, char *str2)}] {\small (a)} \\
Case-insensitive equivalent of \texttt{strrstr}.
\item[\texttt{char *\_FP\_stoupper (char *string)}] {\small (a)} \\
Converts all alphabetic characters in \texttt{string} to uppercase.
\item[\texttt{char *\_FP\_stolower (char *string)}] {\small (a)} \\
Converts all alphabetic characters in \texttt{string} to lowercase.
\item[\texttt{int \_FP\_strmatch (char *str, char *pat)}] {\small (a)} \\
Performs glob-style pattern matching. \texttt{pat} is a string
containing regular characters and the two wildcards '?'
(question mark) and '*'. The question mark matches any single
character, the '*' matches any zero or more characters. If
\texttt{str} is matched by \texttt{pat}, the function returns 1,
otherwise 0.
\item[\texttt{char *\_FP\_fgets (char *buf, int max, FILE *file)}] {\small (f)} \\
Extends the standard \texttt{fgets()}; this replacement is able to
handle line terminators from various systems. DOS text files have
their lines terminated by CRLF, Unix files by LF only and Mac files by
CR only. This function reads a line and replaces whatever line
terminator present with a single LF.
\item[\texttt{char *\_FP\_strpbrk (char *str, char *accept)}] {\small (ns)} \\
Locates the first occurrence in the string \texttt{str} of any of
the characters in \texttt{accept}.
\item[\texttt{char *\_FP\_strtok (char *str, char *del)}] {\small (ns)} \\
Considers the string \texttt{str} to be a sequence of tokens separated
by one or more of the delimiter characters given in \texttt{del}. Upon
first call with \texttt{str!=NULL}, returns the first token. Later
calls with \texttt{str==NULL} return the following tokens. Returns
\texttt{NULL} if no more tokens are found.
\item[\texttt{char *\_FP\_cutdir (char *str)}] {\small (a)} \\
Returns the filename part of \texttt{str}, meaning everything after
the last slash or backslash in the string. Now replaced with the
concept of the filename filter.
\item[\texttt{char *\_FP\_strerror (int errcode)}] {\small (ns)} \\
A rather dumb replacement of the original one, which transforms error
codes from \texttt{errno} into a human-readable error message. This
function should \emph{only} be used if no native implementation
exists; it just returns a string with the numerical error number.
\item[\texttt{char *\_FP\_tempnam (char *dir, char *pfx)}] {\small (ns)} \\
The original is supposed to return a unique filename. The temporary
file should be stored in \texttt{dir} and have a prefix of
\texttt{pfx}. This replacement, too, should only be used if no native
implementation exists. It just returns a temporary filename created by
the standard \texttt{tmpnam()}, which not necessarily resides in a
proper \texttt{TEMP} directory. The value returned by this function is
an allocated memory area which must later be freed by calling
\texttt{free}.
\end{description}
\section{Known Problems}
This section mentions a few known problems with the library, which the
author considers to be ``features'' rather than ``bugs'', meaning that
they probably won't be ``fixed'' in the near future.
\begin{itemize}
\item Encoding to \emph{BinHex} is not yet supported.
\item The checksums found in \emph{BinHex} files are ignored.
\item If both data and resource forks in a \emph{BinHex} file are
non-empty, the larger one is decoded. Non-Mac systems can only use one
of them anyway (usually the ``data'' fork, the ``resource'' fork
usually contains M68k or PPC machine code).
\end{itemize}
\begin{thebibliography}{RFC1521}
\bibitem[RFC0822]{rfc0822} Crocker, D., ``Standard for the Format of
ARPA Internet Text Messages'', RFC 822, Network Working Group, August
1982.
\bibitem[RFC1521]{rfc1521} Borenstein, N., ``MIME (Multipurpose
Internet Mail Extensions) Part One'', RFC 1344, Network Working Group,
September 1993.
\bibitem[RFC1741]{rfc1741} Faltstr\o{}m, P., Crocker, D. and Fair, E.,
``MIME Content Type for BinHex Encoded Files'', RFC 1741, Network
Working Group, December 1994.
\bibitem[RFC1806]{rfc1806} Troost, R., Dorner, S., ``The
Content-Disposition Header'', RFC 1806, Network Working Group, June
1995.
\end{thebibliography}
RFC documents (``Request for Comments'') can be downloaded from many
ftp sites around the world.
\newpage
\begin{appendix}
\section{Encoding Formats}
The following sections describe the four most widely used formats
for encoding binary data into plain text, \emph{uuencoding},
\emph{xxencoding}, \emph{Base64} and \emph{BinHex}. Another section
shortly mentions \emph{Quoted-Printable} encoding.
Other formats exist, like \emph{btoa} and \emph{ship}, but they are
not mentioned here. \emph{btoa} is much less efficient than the
others. \emph{ship} is slightly more efficient and will probably be
supported in future.
In order to illustrate the encodings and present some actual data, we
will present the following text encoded in each of the formats:
\begin{quote}
\begin{small}
\begin{verbatim}
This is a test file for illustrating the various
encoding methods. Let's make this text longer than
57 bytes to wrap lines with Base64 data, too.
Greetings, Frank Pilhofer
\end{verbatim}
\end{small}
\end{quote}
\subsection{Uuencoding}
A document actually describing uuencoding as a standard does not seem
to exist. This is probably the reason why there are so many broken
encoders and decoders around that each take their liberties with the
definition. The following text describes the rules used within the
encoding engine of the encoding library; the decoding routines are
much relaxed and accept certain violations of the rules.
Uuencoded data starts with a ``begin'' line and continues until the
``end'' line:
\begin{quote}
\begin{small}
\texttt{begin} \emph{mode} \emph{filename} \\
\dots{} \emph{encoded data} \dots{} \\
\emph{``empty'' line} \\
\texttt{end}
\end{small}
\end{quote}
``mode'' is an octal number, usually with three digits, describing the
access permissions of the target file. This is the mode used with the
Unix \texttt{chmod} command and also supported by the \texttt{open}
function. Each of the three digits is a binary or of the values 4 (read
permission), 2 (write permission) and 1 (execute permission). The
first digit gives the user's permissions, the second one the
permissions for the group the user is in, and the third digit
describes everyone else's permissions. On DOS or other systems with
only a limited concept of file permissions, only the first digit
should be evaluated. If the ``2'' bit is not set, the resulting file
should be read-only, the ``1'' bit should be set for COM and EXE
files.
``filename'' is the name of the file. The name \emph{should} be
without any directory information.
Data is encoded as \emph{three-in-four}, meaning three
octets\footnote{The term ``octet'' is used here instead of ``byte'',
since it more accurately describes the 8-bit nature of what we
usually call a ``byte''. There are, or were, machines with 9-bit
bytes.} are encoded into four printable characters. Three octets have
24 bits, each character of encoding must thus carry $24/4=6$ bits of
data. Table \ref{tab-3-in-4} describes in detail how the input bits
are copied into the output data bits.
\begin{table}
\centering
\begin{tabular}{|r|c|c|c|c|c|c|c|c|}\hline
Input Octet &1& & & & & & & \\ \hline
Input Bit &7&6&5&4&3&2&1&0 \\ \hline\hline
Output Data \#1 &5&4&3&2&1&0& & \\ \hline
Output Data \#2 & & & & & & &5&4 \\ \hline\hline
Input Octet &2& & & & & & & \\ \hline
Input Bit &7&6&5&4&3&2&1&0 \\ \hline\hline
Output Data \#2 &3&2&1&0& & & & \\ \hline
Output Data \#3 & & & & &5&4&3&2 \\ \hline\hline
Input Octet &3& & & & & & & \\ \hline
Input Bit &7&6&5&4&3&2&1&0 \\ \hline\hline
Output Data \#3 &1&0& & & & & & \\ \hline
Output Data \#4 & & &5&4&3&2&1&0 \\ \hline
\end{tabular}
\caption{Bit mapping for Three-in-Four encoding}
\label{tab-3-in-4}
\end{table}
Each of the output data hextets now has a value from 0 to 63, which is
used to select a character from a table. Uuencoding simply uses the
ASCII characters 32-95 for this purpose (table \ref{tab-uu}). An
exception is the data 0, which would map into the space character
(32). To prevent problems with mailers that strip space characters at
the beginning or end of the line, character 96 ``\,`\,''
is used instead.
\begin{table}
\centering
\begin{tabular}{|r||c|c|c|c|c|c|c|c|}\hline
Data Value &+0&+1&+2&+3&+4&+5&+6&+7 \\ \hline\hline
0 & `& !& "&\#&\$&\%&\&& ' \\ \hline
8 & (& )& *& +& ,& -& .& / \\ \hline
16 & 0& 1& 2& 3& 4& 5& 6& 7 \\ \hline
24 & 8& 9& :& ;&\texttt{\symbol{60}}&=&\texttt{\symbol{62}}&?\\ \hline
32 & @& A& B& C& D& E& F& G \\ \hline
40 & H& I& J& K& L& M& N& O \\ \hline
48 & P& Q& R& S& T& U& V& W \\ \hline
56 & X& Y& Z& [&\texttt{\symbol{92}}&]&\symbol{94}&\_ \\ \hline
\end{tabular}
\caption{Encoding Table for Uuencoding}
\label{tab-uu}
\end{table}
A line of uuencoding starts with the encoded number of encoded octets
on this line. The usual prefix is `M'. By looking up this first
character in table \ref{tab-uu}, we see that it represents the number
45, thus this line features 45 octets encoded into 60 $(45/3*4)$
plain-text characters. The encoded file now continues with lines of
length 61 until the last one, which may be shorter. If the input data
has not a multiple of three octets, the last triple is filled up with
(one or two) nulls. After this last line of data, an ``empty'' line is
printed, meaning a line with zero encoded data, with the first and
only character being ``\,`\,''. The encoded file is then ended
with the ``end'' line.
Uuencoding does not describe a mechanism for splitting a file into two
or more messages for separate mailing or posting. Usually, the encoded
file is simply split into parts of more or less equal line
count\footnote{Of course, encoded files must be split on line
boundaries instead of at a fixed byte count.}. Before the age of smart
decoders, the recipient had to manually concatenate the parts and
remove the headers in between, because the headers of mail messages
\emph{might} just be valid uuencoded data lines, thus potentially
corrupting the data.
There are many variations of the above specification which must be
taken into account in a decoder. Here are the most frequent:
\begin{itemize}
\item Many encoders do not pay attention to the special rule of
encoding the 0 data value and encode it into a space character. This
is not an ``error'' but a potential problem when mailing or posting
the file.
\item Some encoders add a 62nd character to each encoded line:
sometimes a character looping from ``a'' to ``z'' over and over
again. This technique could be used to detect missing lines, but
confuses some decoders.
\item If the input data has not a multiple of three octets, some
encoders omit the ``unnecessary'' characters at the end of the last
data line.
\item Sometimes, the ``empty'' data line at the end is omitted, and at
other times, the line is just completely empty (without the
``\,`\,'').
\end{itemize}
There is also some confusion how to properly terminate a line. Most
encoders simply use the convention of the local system (DOS encoders
using CRLF, Unix encoders using LF, Mac encoders using CR), but with
respect to the MIME standard, the encoding library uses CRLF on all
systems. This causes a slight problem with some Unix decoders, which
look for ``end'' followed directly by LF (as four characters in
total). Such programs report ``end not found'', but nevertheless
decode the file correctly.
This is what our sample text looks like as uuencoded data:
\begin{quote}
\begin{small}
\begin{verbatim}
begin 600 test.txt
M5&AI<R!I<R!A('1E<W0@9FEL92!F;W(@:6QL=7-T<F%T:6YG('1H92!V87)I
M;W5S"F5N8V]D:6YG(&UE=&AO9',N($QE="=S(&UA:V4@=&AI<R!T97AT(&QO
M;F=E<B!T:&%N"C4W(&)Y=&5S('1O('=R87`@;&EN97,@=VET:"!"87-E-C0@
E9&%T82P@=&]O+@I'<F5E=&EN9W,L($9R86YK(%!I;&AO9F5R"@``
`
end
\end{verbatim}
\end{small}
\end{quote}
% ''
\subsection{Xxencoding}
The xxencoding method was conceived shortly after the initial use of
uuencoding. The first implementations of uuencoding did not realize
the potential problem of using the space character for encoding
data. Before this mistake was workarounded with the special case,
another author used a different charset for encoding, composed of
characters available on any system.
\begin{table}
\centering
\begin{tabular}{|r||c|c|c|c|c|c|c|c|}\hline
Data Value &+0&+1&+2&+3&+4&+5&+6&+7 \\ \hline\hline
0 & +& -& 0& 1& 2& 3& 4& 5 \\ \hline
8 & 6& 7& 8& 9& A& B& C& D \\ \hline
16 & E& F& G& H& I& J& K& L \\ \hline
24 & M& N& O& P& Q& R& S& T \\ \hline
32 & U& V& W& X& Y& Z& a& b \\ \hline
40 & c& d& e& f& g& h& i& j \\ \hline
48 & k& l& m& n& o& p& q& r \\ \hline
56 & s& t& u& v& w& x& y& z \\ \hline
\end{tabular}
\caption{Encoding Table for Xxencoding}
\label{tab-xx}
\end{table}
Xxencoding is absolutely identical to uuencoding with the difference
of using a different mapping of data values into printable characters
(table \ref{tab-xx}). Instead of `M', a normal-sized xxencoded line is
prefixed by `h' (note that `h' encodes 45, just as `M' in uuencoding).
The empty data line at the end consists of a single `+' character. Our
sample file looks like the following:
\begin{quote}
\begin{small}
\begin{verbatim}
begin 600 test.txt
hJ4VdQm-dQm-V65FZQrEUNaZgNG-aPr6UOKlgRLBoQa3oOKtb65FcNG-qML7d
hPrJn0aJiMqxYOKtb64pZR4VjN5Ai62lZR0Rn64pVOqIUR4VdQm-oNLVo64lj
hPaRZQW-oO43i0XIr647tR4Jn65Fj65RmML+UP4ZiNLAURqZoO0-0MLBZBXEU
ZN43oMGkUR4xj9Ud5QaJZR4ZiNrAg62NmMKtf63-dP4VjNaJm0U++
+
end
\end{verbatim}
\end{small}
\end{quote}
\subsection{Base64 encoding}
\emph{Base64} is part of the \emph{MIME} (Multipurpose Internet Mail
Extensions) standard, described in \cite{rfc1521}, section 5.2. Sometimes,
it is incorrectly referred to as ``MIME encoding''; the document
specifies much more than just how to encode binary data. As part of a
standard, \emph{Base64} has the advantage of being the best-specified
type of encoding.
\begin{table}
\centering
\begin{tabular}{|r||c|c|c|c|c|c|c|c|}\hline
Data Value &+0&+1&+2&+3&+4&+5&+6&+7 \\ \hline\hline
0 & A& B& C& D& E& F& G& H \\ \hline
8 & I& J& K& L& M& V& O& P \\ \hline
16 & Q& R& S& T& U& V& W& X \\ \hline
24 & Y& Z& a& b& c& d& e& f \\ \hline
32 & g& h& i& j& k& l& m& n \\ \hline
40 & o& p& q& r& s& t& u& v \\ \hline
48 & w& x& y& z& 0& 1& 2& 3 \\ \hline
56 & 4& 5& 6& 7& 8& 9& +& / \\ \hline
\end{tabular}
\caption{Encoding Table for Base64 Encoding}
\label{tab-b64}
\end{table}
The general concept of three-in-four encoding is the same as with the
previous two types, just another new character table to represent the
values needs to be introduced (table \ref{tab-b64}). Note that this
table differs from the \emph{xxencoding} table only in a single
character (`/' versus `-'). If a line of encoding does not feature
either character, it may be difficult to tell which encoding is used
on the line.
The \emph{Base64} encoding does not provide ``begin'' and ``end''
lines; such a concept is not needed, because the framework of a \emph{MIME}
message defines the beginning and end of a part. The encoded data is
defined to be a ``stream'' of characters, and the decoder is supposed
to ignore any ``illegal'' characters in the stream (such as line
breaks or other whitespace). Each line must be shorter than 80
characters and terminated with a CRLF sequence. No particular line
length is enforced, but most implementations encode 57 octets into 76
encoded characters. Theoretically, a line might hold 79 characters,
although this would violate the rule of thumb that the number of data
octets per line is integer.\footnote{Yes, there \emph{are} files
violating this assumption.}
The end-of-file handling if the input data has not a multiple of three
octets is different in \emph{Base64} encoding. If one octet is left at
the end of the input stream, the data is padded with 4 zero bits
(giving a total of 12 bits) and encoded into two characters. After
that, two equal signs `=' are written. If two octets are left, the
data is padded with 2 zero bits (giving a total of 18 bits) and
encoded into three characters, after which a single equal sign `=' is
written.
Here's our sample file in \emph{Base64}. Note that this text is
\emph{only} the encoded data. It is not a valid \emph{MIME}
message. Without the required framework, no proper \emph{MIME}
software will read it.
\begin{quote}
\begin{scriptsize}
\begin{verbatim}
VGhpcyBpcyBhIHRlc3QgZmlsZSBmb3IgaWxsdXN0cmF0aW5nIHRoZSB2YXJpb3VzCmVuY29kaW5n
IG1ldGhvZHMuIExldCdzIG1ha2UgdGhpcyB0ZXh0IGxvbmdlciB0aGFuCjU3IGJ5dGVzIHRvIHdy
YXAgbGluZXMgd2l0aCBCYXNlNjQgZGF0YSwgdG9vLgpHcmVldGluZ3MsIEZyYW5rIFBpbGhvZmVy
Cg==
\end{verbatim}
\end{scriptsize}
\end{quote}
For a more elaborate documentation of \emph{Base64} encoding and
details of the \emph{MIME} framework, I suggest reading \cite{rfc1521}.
The \emph{MIME} standard also defines a way to split a message into
multiple parts so that re-assembly of the parts on the remote end is
easily possible. For details, see section 7.3.2, ``The Message/Partial
subtype'' of the standard.
\subsection{BinHex encoding}
The \emph{BinHex} encoding originates from the Macintosh environment,
and it takes the special properties of a Macintosh file into
account. There, a file has two parts or ``forks'': the ``resource''
fork holds machine code, and the ``data'' fork holds arbitrary
data. For files from other systems, the data fork is usually empty.
I have not found a ``definitive'' definition of the format. My
knowledge is based on two descriptions I found, one from Yves
Lempereur and another from Peter Lewis. A similar description can be
found in \cite{rfc1741}.
\begin{table}
\centering
\begin{tabular}{|r||c|c|c|c|c|c|c|c|}\hline
Data Value &+0&+1&+2&+3&+4&+5&+6&+7 \\ \hline\hline
0 & !& "&\#&\$&\%&\&& '& ( \\ \hline
8 & )& *& +& ,& -& 0& 1& 2 \\ \hline
16 & 3& 4& 5& 6& 8& 9& @& A \\ \hline
24 & B& C& D& E& F& G& H& I \\ \hline
32 & J& K& L& M& N& P& Q& R \\ \hline
40 & S& T& U& V& X& Y& Z& [ \\ \hline
48 & `& a& b& c& d& e& f& h \\ \hline
56 & i& j& k& l& m& p& q& r \\ \hline
\end{tabular}
\caption{Encoding Table for BinHex Encoding}
\label{tab-bh}
\end{table}
A \emph{BinHex} file is a stream of characters, beginning and ending
with a colon `:'; intermediate line breaks are to be ignored by the
decoder. Each line but the last should be exactly 64 characters in
length. The last line may be shorter, and in a special case can also
be 65 characters long. The trailing colon must not stand alone, so if
the input data ends on an output line boundary, the colon is appended
to this line as 65th character. Thus a \emph{BinHex} begins with a
colon in the first column and ends with a colon \emph{not} in the
first column.
The line before the beginning of encoded data (before the initial
`:') should contain the following verbatim text:\footnote{In fact, this
text is \emph{required} by certain decoding software.}
\begin{quote}
\begin{verbatim}(This file must be converted with BinHex 4.0)\end{verbatim}
\end{quote}
BinHex is another three-in-four encoding, and not surprisingly,
another different character table is used (table \ref{tab-bh}).
The documentation does not explicitely mention what is supposed to
happen if the original input data does not have a multiple of three
octets. But from reading between the lines, it looks like
``unnecessary'' characters (those that would result in equal
signs in Base64 encoding) are not printed.
\begin{table}
\centering
\begin{tabular}{|cccccc|c|cccccc|} \hline
\multicolumn{6}{|c|}{Compressed Data} &&
\multicolumn{6}{|c|}{Uncompressed Data} \\ \hline\hline
00 & 11 & 22 & 33 & 44 & 55 &$\mapsto$& 00 & 11 & 22 & 33 & 44 & 55 \\ \hline
11 & 22 & 90 & 04 & 33 & &$\mapsto$& 11 & 22 & 22 & 22 & 22 & 33 \\ \hline
11 & 22 & 90 & 00 & 33 & 44 &$\mapsto$& 11 & 22 & 90 & 33 & 44 & \\ \hline
2B & 90 & 00 & 90 & 04 & 55 &$\mapsto$& 2B & 90 & 90 & 90 & 90 & 55 \\ \hline
\end{tabular}
\caption{BinHex RLE decoding}
\label{bh-rle}
\end{table}
The encoded characters decode into a RLE-compressed bytestream, which
must be handled in the next step (of course, decoding and
decompressing are usually handled at the same time). A Run Length
Encoding simply replaces multiple subsequent occurrences of one octet
are replaced by the character, a special marker, and the repetition
count. BinHex uses the marker \texttt{0x90} (octal \texttt{0220},
decimal \texttt{128}). The octet sequence \texttt{0xff} \texttt{0x90}
\texttt{0x04} would decompress into four times \texttt{0xff}. If the
marker itself occurs, it must be ``escaped'' by the special sequence
\texttt{0x90} \texttt{0x00} (the marker with a repetition count of
0). Table \ref{bh-rle} shows four more examples. Note the last
example, where the marker itself is repeated.
\begin{figure}
\centering
\makebox{\input{binhex.tex}}
\caption{BinHex file structure}
\label{bh-parts}
\end{figure}
The decompression results in a data stream which consists of three
parts, the header section, the data fork and the resource fork. Figure
\ref{bh-parts} shows how the sections are composed. The numbers above
each item indicate its size in octets. The header has the following
items:
\begin{description}
\item[n] The length of the filename in octets. This is a single octet,
so the maximum length of a filename is 255.
\item[Name] The filename, \emph{n} octets in length. The length does
not include the final nullbyte (which is actually the next
item).\footnote{The Filename may contain certain characters that are
invalid on MS-DOS systems, like space characters}
\item[0] This single nullbyte terminates the previous filename.
\item[Type] The Macintosh file type.
\item[Auth] The Macintosh ``creator'', the program which wrote the
original file. This and the previous item are used to start the right
program to edit or display a file. I have no idea what common values
are.
\item[Flags] Macintosh file flags. No idea what they are.
\item[Dlen] The number of octets in the data fork.
\item[Rlen] The number of octets in the resource fork.
\item[HC] CRC checksum of the header data.
\end{description}
After the header, at offset $n+22$, follow the \emph{Dlen} octets of
the data fork and a CRC checksum of the data fork (offset
$n+Dlen+22$), then \emph{Rlen} octets of the resource
fork (offset $n+Dlen+24$) and a CRC checksum of the resource fork
(offset $n+Dlen+Rlen+24$). Note that the CRCs are present even if
the forks are empty.
The three CRC checksums are calculated as described in the following
text, taken from Peter Lewis' description:
\begin{quote}
BinHex 4.0 uses a 16-bit CRC with a 0x1021 seed. The general algorithm is
to take data 1 bit at a time and process it through the following:
\begin{enumerate}
\item Take the old CRC (use 0x0000 if there is no previous CRC) and shift it
to the left by 1.
\item Put the new data bit in the least significant position (right bit).
\item If the bit shifted out in (1) was a 1 then xor the CRC with 0x1021.
\item Loop back to (1) until all the data has been processed.
\end{enumerate}
\end{quote}
This is the sample file in \emph{BinHex}. However, the encoder I used
replaced the LF characters from the original file with CR
characters. It probably noticed that the input file was plain text and
reformatted it to Mac-style text, but I consider this a software
bug. The assigned filename is ``test.txt''.
\begin{quote}
\begin{small}
\begin{verbatim}
(This file must be converted with BinHex 4.0)
:#&4&8e3Z9&K8!&4&@&4dG(Kd!!!!!!#X!!!!!+3j9'KTFb"TFb"K)(4PFh3JCQP
XC5"QEh)JD@aXGA0dFQ&dD@jR)(4SC5"fBA*TEh9c$@9ZBfpND@jR)'ePG'K[C(-
Z)%aPG#Gc)'eKDf8JG'KTFb"dCAKd)'a[EQGPFL"dD'&Z$68h)'*jG'9c)(4[)(G
bBA!JE'PZCA-JGfPdD#"#BA0P0M3JC'&dB5`JG'p[,Je(FQ9PG'PZCh-X)%CbB@j
V)&"TE'K[CQ9b$B0A!!!!:
\end{verbatim}
\end{small}
\end{quote}
\subsection{Quoted-Printable}
The \emph{Quoted-Printable} encoding is like \emph{Base64} part of the
\emph{MIME} standard, described in \cite{rfc1521}. It is not suitable
for encoding arbitrary binary data, but is intended for ``data that
largely consists of octets that correspond to printable characters''.
It is widely in use in countries with an extended character set, where
characters like the German umlauts `\"a' or `\ss' are represented by
non-ASCII characters with the highest bit set.
The essence of the encoding is that arbitrary octets can be
represented by an equal sign `=' followed by two hexadecimal
digits. The equal sign itself, for example, is encoded as ``=3D''.
Quoted-Printable enforces a maximum line length of 76
characters. Longer lines can be wrapped using soft line breaks. If the
last character of an encoded line is an equal sign, the following line
break is to be ignored.
It would indeed be possible to transfer arbitrary binary data using
this encoding, but care must be taken with line breaks, which are
converted from native format on the sender's side and back into native
format on the recipient's side. However, the native representations
may differ. But this alternative is hardly worth considering, since
for arbitrary data, \emph{quoted-printable} is substantially less
effective than \emph{Base64}.
Please refer to the original document, \cite{rfc1521}, for a complete
discussion of the encoding.
\end{appendix}
\end{document}
uudeview-0.5.13/doc/structure.fig 100644 310 144 2000 6155632130 14342 0 ustar fp fpp #FIG 3.1
Landscape
Center
Inches
1200 2
2 3 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 10
3375 1725 3375 1200 1425 1200 1425 3000 3375 3000 3375 2475
1650 2475 1650 1725 3300 1725 3375 1725
2 3 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 10
1350 3000 825 3000 825 525 3975 525 3975 3000 3450 3000
3450 1125 1350 1125 1350 3000 1350 3000
2 2 0 1 -1 7 0 0 -1 0.000 0 0 0 0 0 5
900 3075 3900 3075 3900 3375 900 3375 900 3075
2 2 0 2 -1 7 0 0 -1 0.000 0 0 0 0 0 5
1725 1800 3375 1800 3375 2400 1725 2400 1725 1800
4 1 -1 0 0 2 12 0.0000000 0 135 885 2550 2025 UUDeview\001
4 1 -1 0 0 0 10 0.0000000 0 135 960 2400 2700 Application OS\001
4 1 -1 0 0 0 10 0.0000000 0 105 1080 2400 2925 Services Interface\001
4 1 -1 0 0 0 10 0.0000000 0 135 750 2400 1425 Application\001
4 1 -1 0 0 0 10 0.0000000 0 135 1155 2400 1650 Language Interface\001
4 1 -1 0 0 0 12 0.0000000 0 180 870 2400 900 Application\001
4 1 -1 0 0 0 12 0.0000000 0 180 1365 2400 3300 Operating System\001
4 1 -1 0 0 0 12 0.0000000 0 180 1305 2550 2295 Decoding Library\001
uudeview-0.5.13/doc/td-v2.c 100644 310 144 1721 6155632130 12724 0 ustar fp fpp #include <stdio.h>
#include <string.h>
#include <errno.h>
#include <stdlib.h>
#include <config.h>
#include <uudeview.h>
int main (int argc, char *argv[])
{
uulist *item;
int i, res;
UUInitialize ();
for (i=1; i<argc; i++)
if ((res = UULoadFile (argv[i], NULL, 0)) != UURET_OK)
fprintf (stderr, "could not load %s: %s\n",
argv[i], (res==UURET_IOERR) ?
strerror (UUGetOption (UUOPT_ERRNO, NULL, NULL, 0)) :
UUstrerror(res));
for (i=0; (item=UUGetFileListItem(i)) != NULL; i++) {
if ((item->state & UUFILE_OK) == 0)
continue;
if ((res = UUDecodeFile (item, NULL)) != UURET_OK) {
fprintf (stderr, "error decoding %s: %s\n",
(item->filename==NULL)?"oops":item->filename,
(res==UURET_IOERR) ?
strerror (UUGetOption (UUOPT_ERRNO, NULL, NULL, 0)) :
UUstrerror(res));
}
else {
printf ("successfully decoded '%s'\n", item->filename);
}
}
UUCleanUp ();
return 0;
}
uudeview-0.5.13/doc/td-v3.c 100644 310 144 3276 6155632130 12734 0 ustar fp fpp #include <stdio.h>
#include <string.h>
#include <errno.h>
#include <stdlib.h>
#include <config.h>
#include <uudeview.h>
#include <fptools.h>
void MsgCallBack (void *opaque, char *msg, int level)
{
fprintf (stderr, "%s\n", msg);
}
char * FNameFilter (void *opaque, char *fname)
{
static char dname[13];
char *p1, *p2;
int i;
if ((p1 = _FP_strrchr (fname, '/')) == NULL)
p1 = fname;
if ((p2 = _FP_strrchr (p1, '\\')) == NULL)
p2 = p1;
for (i=0, p1=dname; *p2 && *p2!='.' && i<8; i++)
*p1++ = (*p2==' ')?(p2++,'_'):*p2++;
while (*p2 && *p2 != '.') p2++;
if ((*p1++ = *p2++) == '.')
for (i=0; *p2 && *p2!='.' && i<3; i++)
*p1++ = (*p2==' ')?(p2++,'_'):*p2++;
*p1 = '\0';
return dname;
}
int main (int argc, char *argv[])
{
uulist *item;
int i, res;
UUInitialize ();
UUSetMsgCallback (NULL, MsgCallBack);
UUSetFNameFilter (NULL, FNameFilter);
for (i=1; i<argc; i++)
if ((res = UULoadFile (argv[i], NULL, 0)) != UURET_OK)
fprintf (stderr, "could not load %s: %s\n",
argv[i], (res==UURET_IOERR) ?
strerror (UUGetOption (UUOPT_ERRNO, NULL, NULL, 0)) :
UUstrerror(res));
for (i=0; (item=UUGetFileListItem(i)) != NULL; i++) {
if ((item->state & UUFILE_OK) == 0)
continue;
if ((res = UUDecodeFile (item, NULL)) != UURET_OK) {
fprintf (stderr, "error decoding %s: %s\n",
(item->filename==NULL)?"oops":item->filename,
(res==UURET_IOERR) ?
strerror (UUGetOption (UUOPT_ERRNO, NULL, NULL, 0)) :
UUstrerror(res));
}
else {
printf ("successfully decoded '%s' as '%s'\n",
item->filename,
UUFNameFilter (item->filename));
}
}
UUCleanUp ();
return 0;
}
uudeview-0.5.13/doc/test.txt 100644 310 144 254 6155632130 13324 0 ustar fp fpp This is a test file for illustrating the various
encoding methods. Let's make this text longer than
57 bytes to wrap lines with Base64 data, too.
Greetings, Frank Pilhofer
uudeview-0.5.13/COPYING 100644 310 144 43076 6155632120 12142 0 ustar fp fpp GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
675 Mass Ave, Cambridge, MA 02139, USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Library General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
Appendix: How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) 19yy <name of author>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) 19yy name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
<signature of Ty Coon>, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Library General
Public License instead of this License.
uudeview-0.5.13/HOWTO 100644 310 144 21253 6155632123 11726 0 ustar fp fpp
WORKING MAIL AND NEWS SOFTWARE
This article describes how to save mail and news from other software
in order to decode articles with UUDeview. The first section gives
general hints, further downwards are step-by-step instructions for
popular Unix and Windows software.
General: Saving Articles
As far as I know, any mail or news reading software allows to save one
or more articles to your local disk. So to decode files, all you have
to do is to save the encoded articles, and later run these files
through UUDeview.
Note: In the following text, I will use the word "article"
synonymous for both email messages and news articles. From the
decoder's standpoint, they're the same.
The advantage of UUDeview is that you do not have to worry about the
ordering of articles. It doesn't matter if you save part 7 before part
5, or if some parts of file B suddenly appear among file A's parts.
You must only make sure that you save all parts of a multipart
message.
Saving just a single article is never a problem, but there are usually
three methods for saving multiple articles for decoding. Your software
might not support all of them. They're listed here from "best" to
"worst":
Tagging (Selecting, Marking) and Saving
Some software allows you, usually while viewing an overview of
all articles (seeing only the article's subjects), to tag
(sometimes also called "select" or "mark") multiple articles.
In Windows, the policy is usually to hold down the CTRL key and
then clicking on the desired subjects. Then, all tagged
articles can be saved at once into a single file.
Sequential Saving into one File
This method involves visiting and saving each article
individually. You select "save article" for each article in
turn, but using the same filename again and again. The software
should then append each article to the existing file (some
software will ask you whether you want to append; choose
"yes"). Alas, a few programs will just overwrite the existing
file with the new article, causing the final file to hold only
the last article in the series. You should check the behaviour
of your software by saving two articles this way and then
looking at the resulting file. In that case, you're stuck with
the worst method:
Saving into multiple Files
The most inconvenient method works with any program: you select
each article separately, and save it into its own file, using
different filenames. You don't need to use sensible filenames,
a series of numbers (001.uu, 002.uu etc) is enough. Make sure
you use the same directory for all files. The problem with this
method is that it leaves plenty of room for mistakes (such as
overlooking an article, using the same file name twice etc),
and that you'll need to hand over lots of files to UUDeview
lateron.
Two minor matters to settle are the directory where to save articles,
and the file names to use. As for the directory, I suggest creating a
separate directory. This has the advantage that you can later, in
UUDeview, just select all files from that directory for decoding,
which is usually much simpler than picking out five files out of two
dozen. Also, after a successful decoding run, you can simply delete
the entire directory's contents without worrying what's within.
The matter of file names is equally simple: it doesn't matter. Just
use something you can remember. UUDeview does not evaluate the file
name or extension in any way. You might find an extension of "uu"
convenient.
Some software allows you to select whether you want to save articles
with or without header. If it does, always select with header. Many
features of UUDeview depend on the headers. Stripping them disables
part reordering and other smartness.
_________________________________________________________________
Step-by-Step Instructions
These are precise instructions how to save articles from a couple of
popular mail and news readers. Even if your favourite software is not
listed here, the basic handling is usually quite similar to one of
those presented here.
* Unix Software
+ The Mail reader "elm"
+ The Newsreader "nn"
+ The Newsreader "xrn"
* Windows Software
+ Eudora for Windows
+ Forte Free Agent
_________________________________________________________________
Unix Software
Saving Mails from elm
Go to each mail, and tag it by pressing 't' (a plus sign will appear
at the beginning of the current line, meaning the article is tagged).
After repeating this procedure for all desired articles, hit the 's'
("save") key. Elm will offer a mail folder to save the article to;
just overwrite it with a proper file name (which may include directory
names). You can cancel the save operation by giving an empty file
name. Otherwise, all tagged mails are saved at once to the given file
(if the file exists, they're appended).
Saving Articles from nn
You can save multiple articles from a single newsgroup at once. If you
want to save articles from different newsgroups, you'll have to repeat
this procedure for each of them.
You can tag a single article by pressing the letter displayed in the
first column (left of the author name), or multiple articles by a
sequence like 'f-o', which would tag all articles from 'f' to 'o'. You
can also skip pages forward and backward using the '>' and '<' keys to
tag article on different pages within a newsgroup. Then, press a
capital 'S' (using the shift key) to save the articles. It will then
ask you where to save the articles to ("Save on"), with the newsgroup
name being the default. Remove this name with the backspace key (don't
forget the leading plus sign) and enter a filename of your choice (may
include a directory name). After hitting return, all tagged articles
from this newsgroup are saved at once to the given file (if it exists,
the articles are appended).
Saving Articles from xrn
You can save multiple articles from a single newsgroup at once. If you
want to save articles from different newsgroups, you'll have to repeat
this procedure for each of them.
If you click on one subject, then hold down the shift key and click on
another subject, all articles inbetween are tagged (so to tag all
articles in the newsgroup, click on the first, browse the listbox to
its end, hold down shift, then click on the last article). By holding
down the CTRL key and then clicking on articles' subjects, you can tag
multiple individual articles. While operating the scrollbar, you'll
have to let go of the shift or CTRL key, but don't forget to press it
again before the next clicking.
After all articles have been selected, click on the 'Save' button in
the lower left corner of the screen, anter a filename, and XRN will
save all selected articles into that file. And you're done!
Windows Software
Saving Mails from Eudora
1. Open the mailbox (usually the incoming mailbox). You see the
collection of email subjects.
2. Tag the appropriate mails by holding down the CTRL key and
clicking on the subject lines.
3. Choose "Save As" from the "File" menu.
4. Browse to the appropriate directory and enter a filename of your
choice.
5. Unselect (uncheck if checked) the "Guess Paragraphs" option, and
Select (check if unchecked) the "Include Headers" option.
6. Click on OK to save all tagged emails to the given file.
Saving Articles from Free Agent
1. Choose the newsgroup you want to save articles from.
2. Tag the appropriate articles by holding down the CTRL key and
clicking on the subject lines in the subject window (usually in
the top right of the screen).
3. Choose "Save Articles As" from the "File" menu.
4. Browse to the appropriate directory and enter a filename of your
choice.
5. For the option "Header Fields to Include", select "All fields".
6. Select (check if unchecked) the "Append to existing File" option.
7. Click on OK to save all tagged articles to the given file.
_________________________________________________________________
Frank Pilhofer <fp@informatik.uni-frankfurt.de> Back to the Homepage
Last modified: Fri Apr 12 14:36:13 1996
uudeview-0.5.13/HISTORY 100644 310 144 45004 6267510134 12170 0 ustar fp fpp #
# $Id: HISTORY,v 1.16 1997/01/16 20:32:28 fp Exp $
#
PROGRAM HISTORY
---------------
(remember that all _dates_ are dd.mm.yyyy)
0.1
-----
First release. Took less than a week of coding. Most features should work now.
All files I encountered can be decoded properly. Some special cases, however,
are still untested. This version was updated two or three times without
upgrading the version number because that were just minor changes.
0.2
-----
DOS support! After getting some requests for a DOS version, many portions of
the code have been completely rewritten so that the file data is not loaded
into memory. Instead, just an index is saved. Added +e option to select file
extensions. Added +i option to disable user questioning.
Some special cases to evaluate the part no. of the subject line added
Automatic uncompress / gunzip (need to have them installed)
Tar file handling - extract files right out of a tar archive. This is done
from uudeview itself, so you won't need an external tar.
0.3
-----
Getting smarter every day. After I found some postings with spelling mistakes
in the subject line (namely "something.zip" instead of "something.arj"), I
began to program "Smart Part Merging System" (SPMS (R)). It detects that the
parts of "something.zip" are just the missing parts of "something.arj" and
merges both files. This feature will still need a lot of maintenance, since
there are a lot of special cases.
Added a ton of features. Now you can list the files or enter commands to do
anything with them (you can enter "xv $") to watch the file.
Installed a signal handler for SIGINT (Ctrl-C). If the program was interrupted
by the user, it left LOTS of temporary files in /usr/tmp. They will now be
cleaned.
Again, the user interface was changed. I did that in 0.2, so why not again
in 0.3. I hope you'll agree it's a bit better now.
The program now checks if gunzip has failed (it tests if the resulting file
has less than 2 bytes).
Fixed a bug with filenames that contained spaces at the end.
Linked files in tar archives are now ignored.
In 0.2 each file was decoded before the user was prompted what to do. This
was quite slow on some machines. Now the files are only decoded on request.
0.3.42
--------
I'm quite lazy with documenting all the changes I made to the source code.
I hope I will keep online this time. To do this, I have invented the patch-
level number. Since I have made a lot of changes to the original 0.3 release,
I start with patchlevel 42.
0.3.43
--------
- gets suspicious if it finds multiple begins/ends within the same post
and opens up a new file record
- Treats "BEGIN -- CUT HERE" line exceptionally, because it frequently looks
like valid uuencoded data and fooled the program. The 4-line-safety barrier
didn't catch because the real data followed immediately.
0.3.44 (25.01.1995)
--------
- added lots of patches to allow for Mime Base64 decoding ... mostly because
I want to decode this Lion King MPEG from alt.binaries.multimedia
0.3.45 (29.01.1995)
--------
- added XX decoding scheme. Was really simple after having to change every-
thing for the above MIME stuff anyway. Just another decoding table. Hope
it works.
0.3.46 (01.02.1995)
--------
- included groundworks for desperate mode. I don't know -- should I leave
the '-d' command line option out?
0.3.47 (03.02.1995)
--------
- written my own more function. previously, I just called system(), but this
was (a) unstable and (b) didn't work in QuickWin
- included '(i)' action to show file info; either part 0, or part 1 up to the
begin line
- desperate mode finished. Moved the original '-d' (decompress) option to
'-x' (didn't use it anyway, and needs major rewriting) and replaced it
with new desperate option
0.3.48 (04.02.1995)
--------
- wrote an case-insensitive string compare function. Have migrated the
extension detection to case-insensitivity
- added some code to detect some common file suffixes (jpg, gif etc.)
added SPMS check: parts of files will not be merged if they have different
but correct suffixes (if one of the files' suffix is not recognized, it
might just be spelled wrong, so this doesn't prevent merging). This should
stop SMPS from merging together complete junk.
- generalized Unix Makefile. Now I only have to change a version number in
one place (well in three places if I consider DOS&Windows with other make
files).
- added multiple passes to SMPS. In first pass, only "exact fits" are merged,
in second pass only files with minimal differences, in third pass, everything
- stripping some boring headers in file (i)nfo
- now it should also accept files with less than 4 lines of data
- finally found the 'bug' that declared some final lines as invalid -- the
encoder has stripped unnecessary chars. Added more checks ...
0.4 (06.02.1995)
-----
- After getting no bugreports for a few weeks (either nobody uses the program
or it does work after all), I renamed 0.3.48 to 0.4. There is so much dif-
ferent from the original 0.3 that I simply need to indicate these changes
to users. And besides, it's my birthday :-)
- Deleted "ALPHA" indication from the windows version. Now fully integrated.
- moved MIME check in front of UUdata check. Strongest semantics first.
0.4.1 (08.02.1995)
-------
- Added additional check for a part number on the subject line:
"test.gif 3 of 4" was detected to be 4, now done correctly.
0.4.2 (10.02.1995)
-------
- bugfixed uudeview.c:IsKnownExtension() which would core dump on some
systems due to NULL read access. Thanks to J. Wilkinson,
<jcw@stuey.eng.pko.dec.com> for pointing out the problem.
This isn't fatal for DOS, and also shouldn't be fatal in Windows.
0.4.3 (14.02.1995)
-------
- some people couldn't compile the Unix version because I used two
non-standard string functions, strrstr() and strdup(). Thought they
were defined everywhere. Now I've written them on my own.
- moved _FP_strnicmp() to uuutil.c
0.4.4 (24.02.1995)
-------
- trimmed comments in header files because some compilers warned about
"nested comments"
- fixed annoying bug in CheckGlobalList() that caused infinite loops
and may also have caused core dumps if more than 98 parts were missing
from a posting
- added another clause to the detection of a part number on the subject
line after getting a file by the name of abc-1019.gif, where a part num-
ber of 1019 was detected
0.4.5 (02.03.1995)
-------
- Added workaround for Netscape, which completely messes up encoded data
on some setups. It replaces &,<,> by their html equivalents and occasio-
nally inserts some junk HREF links. Now whenever an invalid line is found,
it is NetscapeCollapse()d, in the hope it's decodeable afterwards.
0.4.6 (11.04.1995)
-------
- wow, I just see that it's been a long time since the last bugfix. I guess
it is indeed getting better :-)
- UUdeview would ignore files with double-spacing (one line of data followed
by an empty line). Now, all empty lines are ignored. I just hope this
doesn't add problems elsewhere. Thanks to Gary for this one.
- a slight bug in the Base64 detection made the program fail to pick up the
destination filename when quoted
0.4.7 (07.05.1995)
-------
- the mime detection was looking for the "Content-Type" message. Now, this
tag is accepted case-insensitive.
- if no trailing lines were at the end of a Base64-encoded file, some data
was written twice, resulting in trailing garbage data.
0.4.8 (22.05.1995)
-------
- all string compares are now case insensitive, especially because I
found mime headers in all kinds of variations
- small bug fixed that caused uudeview to ignore some files where the
first part didn't have encoded data
- included checking if files exist, prompting the user whether it shall
be overwritten. suggested and coded by Kevin B. York
- new: the encoding engine! incorprorated into the launcher in Windows,
for Dos/Unix, it's in the external 'uuenview' program.
0.4.9 (07.06.1995)
-------
- allows an 'end' after the encoded data with only an _empty_ line
inbetween. Previously, I expected a valid encoded line with zero
data, meaning that the single character on that line is '`' (UUE)
or '+' (XXE)
0.4.10 (14.06.1995)
--------
- funny bug fixed: if the decoder found a valid UUencoded line in a
supposed MIME-data file, it decoded the single line and exited. In
my case, a MIME header triggered this.
- fixed bug with more than one MIME-encoded file in a single message.
- serious bug fixed when overwriting an existing file: I had forgot-
ten O_TRUNC when opening the file, causing some undefined behavior.
0.4.11 (16.06.1995)
--------
- renamed all variables 'this' and 'new', as some C++ compilers don't
like using these keywords as names
- renamed the variable 'inpfile' in uudeview.c:more(); I had a type
of the same name (ec@matufia.sp.TRW.COM)
0.4.12 ()
--------
- more smartness (although I now can't remember where, probably everywhere)
- fixed problem with multiple MIME attachments in a single mail
- can now decode news articles from lynx, which were messed up similar
to Netscape news files, only worse.
- one appearance of strdup() in uuio.c slipped through. Now replaced
by _FP_strdup()
- Instead of having to choose to rename or overwrite existing files each
time, you can now enter 'a' once to overwrite them all.
- The Ultrix C compiler ignored hex escape sequences, which were used in
uuenview.c for CRLF. Now they're in octal.
- not so picky if the last line is longer than expected. some encoders
(more than one!) failed to let the last line end where it was supposed
to end.
- complete rewrite of uuenview. It can now email and post files direcly.
For the purpose of posting, a mini inews program, written by Steven Grady,
<grady@postgres.berkeley.edu>, is included in the distribution
- finally: manual pages! And make install works as well as make install.man!
Thanks to all the people who have been bothering me for months :)
- uudeview and uuenview can now behave similar to uudecode and uuencode
if called like that (ln -s uudeview uudecode). Of course, you don't
loose any smartness. My ultimate goal is to replace these outdated tools.
- attempt to enforce stronger subject-line semantics. uuenview prints the
part numbers in brackets (partno/numparts) and the file name in hard
brackets [ filename.tar.gz ], and this is what the decoder looks for first.
0.4.13 (20.10.1995)
--------
- after sending out so many 'beta' versions of 0.4.12 and being asked
whether there's a new one available, I've decided to skip an official
0.4.12.
- Scan speed greatly improved. And if you're sure you only have one article
per file, you can use the undocumented "-f" option for even more speed.
But then everything becomes quite unsafe, as incomplete files are only
detected when decoding.
- don't ignore RETries
- reworked most documentation, and rearranged the rest. All packages now
only include the documentation the reader really needs
- Win version includes a new version of the Launcher, compiled with the
new encoding routines, and also remembering its screen position and size
- Oops, the Netscape repair code was partially broken and needed some repair
itself.
- xxdecoding was broken because of over-tolerant uudecoding
- uudecoding was broken because of over-tolerant uudecoding :(
0.4.15 (20.01.1996)
--------
- Implemented my own version of fgets() that allows to transparently read
lines terminated either with LF (Unix), CRLF (DOS) or CR (Mac). Sadly,
it's slower than the original.
- in previous versions, I have very much relaxed the checking for uudecoded
lines (valid_data()). Now I only allow the less strong code (meaning,
allow the data look more weird, more off the specs) if I'm sure it actually
_is_ uuencoded data. This should work in all cases because it was usually
only the last line with was "erroneous"
- included option '-b' to let part numbers in [] take precedence over ()
this only affects the kind of brackets uudeview looks to find a part
number _first_
- fixed problems with multiple MIME attachments
- got rid of the 'Ignore Replies' switch. It caused lots of confusion and
didn't really help anything.
- included option '-f' for fast scanning. Only works if each input file
contains at most one article. Many sanity checks cannot be performed
because
