uuencode.c revision 96810 
1/*-
2 * Copyright (c) 1983, 1993
3 *	The Regents of the University of California.  All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 *    notice, this list of conditions and the following disclaimer in the
12 *    documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 *    must display the following acknowledgement:
15 *	This product includes software developed by the University of
16 *	California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 *    may be used to endorse or promote products derived from this software
19 *    without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
34#ifndef lint
35static const char copyright[] =
36"@(#) Copyright (c) 1983, 1993\n\
37	The Regents of the University of California.  All rights reserved.\n";
38#endif /* not lint */
39
40#if 0
41#ifndef lint
42static char sccsid[] = "@(#)uuencode.c	8.2 (Berkeley) 4/2/94";
43#endif /* not lint */
44#endif
45
46#include <sys/cdefs.h>
47__FBSDID("$FreeBSD: head/usr.bin/uuencode/uuencode.c 96810 2002-05-17 12:27:02Z jmallett $");
48
49/*
50 * uuencode [input] output
51 *
52 * Encode a file so it can be mailed to a remote system.
53 */
54#include <sys/param.h>
55#include <sys/socket.h>
56#include <sys/stat.h>
57
58#include <netinet/in.h>
59
60#include <err.h>
61#include <resolv.h>
62#include <stdio.h>
63#include <stdlib.h>
64#include <string.h>
65#include <unistd.h>
66
67void encode(void);
68void base64_encode(void);
69static void usage(void);
70
71FILE *output;
72int mode;
73char **av;
74
75int
76main(int argc, char *argv[])
77{
78	struct stat sb;
79	int base64;
80	char ch;
81	char *outfile;
82
83	base64 = 0;
84	outfile = NULL;
85
86	while ((ch = getopt(argc, argv, "mo:")) != -1) {
87		switch (ch) {
88		case 'm':
89			base64 = 1;
90			break;
91		case 'o':
92			outfile = optarg;
93			break;
94		case '?':
95		default:
96			usage();
97		}
98	}
99	argv += optind;
100	argc -= optind;
101
102	switch(argc) {
103	case 2:			/* optional first argument is input file */
104		if (!freopen(*argv, "r", stdin) || fstat(fileno(stdin), &sb))
105			err(1, "%s", *argv);
106#define	RWX	(S_IRWXU|S_IRWXG|S_IRWXO)
107		mode = sb.st_mode & RWX;
108		++argv;
109		break;
110	case 1:
111#define	RW	(S_IRUSR|S_IWUSR|S_IRGRP|S_IWGRP|S_IROTH|S_IWOTH)
112		mode = RW & ~umask(RW);
113		break;
114	case 0:
115	default:
116		usage();
117	}
118
119	av = argv;
120
121	if (outfile != NULL) {
122		output = fopen(outfile, "w+");
123		if (output == NULL)
124			err(1, "unable to open %s for output", outfile);
125	} else
126		output = stdout;
127	if (base64)
128		base64_encode();
129	else
130		encode();
131	if (ferror(output))
132		errx(1, "write error");
133	exit(0);
134}
135
136/* ENC is the basic 1 character encoding function to make a char printing */
137#define	ENC(c) ((c) ? ((c) & 077) + ' ': '`')
138
139/*
140 * Copy from in to out, encoding in base64 as you go along.
141 */
142void
143base64_encode(void)
144{
145	/*
146	 * Output must fit into 80 columns, chunks come in 4, leave 1.
147	 */
148#define	GROUPS	((80 / 4) - 1)
149	unsigned char buf[3];
150	char buf2[sizeof(buf) * 2 + 1];
151	size_t n;
152	int rv, sequence;
153
154	sequence = 0;
155
156	fprintf(output, "begin-base64 %o %s\n", mode, *av);
157	while ((n = fread(buf, 1, sizeof(buf), stdin))) {
158		++sequence;
159		rv = b64_ntop(buf, n, buf2, (sizeof(buf2) / sizeof(buf2[0])));
160		if (rv == -1)
161			errx(1, "b64_ntop: error encoding base64");
162		fprintf(output, "%s%s", buf2, (sequence % GROUPS) ? "" : "\n");
163	}
164	if (sequence % GROUPS)
165		fprintf(output, "\n");
166	fprintf(output, "====\n");
167}
168
169/*
170 * Copy from in to out, encoding as you go along.
171 */
172void
173encode(void)
174{
175	register int ch, n;
176	register char *p;
177	char buf[80];
178
179	(void)fprintf(output, "begin %o %s\n", mode, *av);
180	while ((n = fread(buf, 1, 45, stdin))) {
181		ch = ENC(n);
182		if (fputc(ch, output) == EOF)
183			break;
184		for (p = buf; n > 0; n -= 3, p += 3) {
185			/* Pad with nulls if not a multiple of 3. */
186			if (n < 3) {
187				p[2] = '\0';
188				if (n < 2)
189					p[1] = '\0';
190			}
191			ch = *p >> 2;
192			ch = ENC(ch);
193			if (fputc(ch, output) == EOF)
194				break;
195			ch = ((*p << 4) & 060) | ((p[1] >> 4) & 017);
196			ch = ENC(ch);
197			if (fputc(ch, output) == EOF)
198				break;
199			ch = ((p[1] << 2) & 074) | ((p[2] >> 6) & 03);
200			ch = ENC(ch);
201			if (fputc(ch, output) == EOF)
202				break;
203			ch = p[2] & 077;
204			ch = ENC(ch);
205			if (fputc(ch, output) == EOF)
206				break;
207		}
208		if (fputc('\n', output) == EOF)
209			break;
210	}
211	if (ferror(stdin))
212		errx(1, "read error");
213	(void)fprintf(output, "%c\nend\n", ENC('\0'));
214}
215
216static void
217usage(void)
218{
219	(void)fprintf(stderr,"usage: uuencode [-m] [-o outfile] [infile] remotefile\n");
220	exit(1);
221}
222