blob: 398aeefe1dd0968b3a28f0028e513104726be33c [file] [log] [blame]
Damien Millerb3cdc222006-03-26 14:30:33 +11001/* $OpenBSD: uuencode.c,v 1.21 2006/03/26 01:31:48 deraadt Exp $ */
Damien Millereba71ba2000-04-29 23:57:08 +10002/*
Damien Millere247cc42000-05-07 12:03:14 +10003 * Copyright (c) 2000 Markus Friedl. All rights reserved.
Damien Millere4340be2000-09-16 13:29:08 +11004 *
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 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
15 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
17 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
18 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
19 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
20 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
21 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Damien Millereba71ba2000-04-29 23:57:08 +100024 */
Damien Millere4340be2000-09-16 13:29:08 +110025
Damien Millereba71ba2000-04-29 23:57:08 +100026#include "includes.h"
Damien Millera10f5612002-09-12 09:49:15 +100027
Damien Millereba71ba2000-04-29 23:57:08 +100028#include "xmalloc.h"
Ben Lindstrom70ea46a2001-02-10 23:30:16 +000029#include "uuencode.h"
Damien Millerbf7f4662000-06-23 10:16:38 +100030
Damien Millereba71ba2000-04-29 23:57:08 +100031int
Damien Millerf58b58c2003-11-17 21:18:23 +110032uuencode(const u_char *src, u_int srclength,
Damien Millere247cc42000-05-07 12:03:14 +100033 char *target, size_t targsize)
Damien Millereba71ba2000-04-29 23:57:08 +100034{
Damien Millere247cc42000-05-07 12:03:14 +100035 return __b64_ntop(src, srclength, target, targsize);
Damien Millereba71ba2000-04-29 23:57:08 +100036}
37
38int
Ben Lindstrom46c16222000-12-22 01:43:59 +000039uudecode(const char *src, u_char *target, size_t targsize)
Damien Millereba71ba2000-04-29 23:57:08 +100040{
Damien Millere247cc42000-05-07 12:03:14 +100041 int len;
42 char *encoded, *p;
Damien Millereba71ba2000-04-29 23:57:08 +100043
Damien Millere247cc42000-05-07 12:03:14 +100044 /* copy the 'readonly' source */
45 encoded = xstrdup(src);
46 /* skip whitespace and data */
47 for (p = encoded; *p == ' ' || *p == '\t'; p++)
Damien Millereba71ba2000-04-29 23:57:08 +100048 ;
Damien Millere247cc42000-05-07 12:03:14 +100049 for (; *p != '\0' && *p != ' ' && *p != '\t'; p++)
50 ;
Ben Lindstrome45a2cb2002-02-26 18:07:26 +000051 /* and remove trailing whitespace because __b64_pton needs this */
Damien Millere247cc42000-05-07 12:03:14 +100052 *p = '\0';
53 len = __b64_pton(encoded, target, targsize);
54 xfree(encoded);
55 return len;
Damien Millereba71ba2000-04-29 23:57:08 +100056}
57
58void
Ben Lindstromc58ab022002-02-26 18:15:09 +000059dump_base64(FILE *fp, u_char *data, u_int len)
Damien Millereba71ba2000-04-29 23:57:08 +100060{
Damien Millerb3cdc222006-03-26 14:30:33 +110061 char *buf;
Damien Millereba71ba2000-04-29 23:57:08 +100062 int i, n;
Ben Lindstrom70ea46a2001-02-10 23:30:16 +000063
Damien Miller07d86be2006-03-26 14:19:21 +110064 if (len > 65536) {
65 fprintf(fp, "dump_base64: len > 65536\n");
66 return;
67 }
68 buf = xmalloc(2*len);
Damien Millere247cc42000-05-07 12:03:14 +100069 n = uuencode(data, len, buf, 2*len);
Damien Millereba71ba2000-04-29 23:57:08 +100070 for (i = 0; i < n; i++) {
71 fprintf(fp, "%c", buf[i]);
72 if (i % 70 == 69)
73 fprintf(fp, "\n");
74 }
75 if (i % 70 != 69)
76 fprintf(fp, "\n");
77 xfree(buf);
78}