1*0Sstevel@tonic-gate /* 2*0Sstevel@tonic-gate * Copyright (c) 2000 Markus Friedl. All rights reserved. 3*0Sstevel@tonic-gate * 4*0Sstevel@tonic-gate * Redistribution and use in source and binary forms, with or without 5*0Sstevel@tonic-gate * modification, are permitted provided that the following conditions 6*0Sstevel@tonic-gate * are met: 7*0Sstevel@tonic-gate * 1. Redistributions of source code must retain the above copyright 8*0Sstevel@tonic-gate * notice, this list of conditions and the following disclaimer. 9*0Sstevel@tonic-gate * 2. Redistributions in binary form must reproduce the above copyright 10*0Sstevel@tonic-gate * notice, this list of conditions and the following disclaimer in the 11*0Sstevel@tonic-gate * documentation and/or other materials provided with the distribution. 12*0Sstevel@tonic-gate * 13*0Sstevel@tonic-gate * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 14*0Sstevel@tonic-gate * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 15*0Sstevel@tonic-gate * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 16*0Sstevel@tonic-gate * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 17*0Sstevel@tonic-gate * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 18*0Sstevel@tonic-gate * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 19*0Sstevel@tonic-gate * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 20*0Sstevel@tonic-gate * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 21*0Sstevel@tonic-gate * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 22*0Sstevel@tonic-gate * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 23*0Sstevel@tonic-gate */ 24*0Sstevel@tonic-gate 25*0Sstevel@tonic-gate #include "includes.h" 26*0Sstevel@tonic-gate RCSID("$OpenBSD: uuencode.c,v 1.16 2002/09/09 14:54:15 markus Exp $"); 27*0Sstevel@tonic-gate 28*0Sstevel@tonic-gate #pragma ident "%Z%%M% %I% %E% SMI" 29*0Sstevel@tonic-gate 30*0Sstevel@tonic-gate #include "xmalloc.h" 31*0Sstevel@tonic-gate #include "uuencode.h" 32*0Sstevel@tonic-gate 33*0Sstevel@tonic-gate int 34*0Sstevel@tonic-gate uuencode(u_char *src, u_int srclength, 35*0Sstevel@tonic-gate char *target, size_t targsize) 36*0Sstevel@tonic-gate { 37*0Sstevel@tonic-gate return __b64_ntop(src, srclength, target, targsize); 38*0Sstevel@tonic-gate } 39*0Sstevel@tonic-gate 40*0Sstevel@tonic-gate int 41*0Sstevel@tonic-gate uudecode(const char *src, u_char *target, size_t targsize) 42*0Sstevel@tonic-gate { 43*0Sstevel@tonic-gate int len; 44*0Sstevel@tonic-gate char *encoded, *p; 45*0Sstevel@tonic-gate 46*0Sstevel@tonic-gate /* copy the 'readonly' source */ 47*0Sstevel@tonic-gate encoded = xstrdup(src); 48*0Sstevel@tonic-gate /* skip whitespace and data */ 49*0Sstevel@tonic-gate for (p = encoded; *p == ' ' || *p == '\t'; p++) 50*0Sstevel@tonic-gate ; 51*0Sstevel@tonic-gate for (; *p != '\0' && *p != ' ' && *p != '\t'; p++) 52*0Sstevel@tonic-gate ; 53*0Sstevel@tonic-gate /* and remove trailing whitespace because __b64_pton needs this */ 54*0Sstevel@tonic-gate *p = '\0'; 55*0Sstevel@tonic-gate len = __b64_pton(encoded, target, targsize); 56*0Sstevel@tonic-gate xfree(encoded); 57*0Sstevel@tonic-gate return len; 58*0Sstevel@tonic-gate } 59*0Sstevel@tonic-gate 60*0Sstevel@tonic-gate void 61*0Sstevel@tonic-gate dump_base64(FILE *fp, u_char *data, u_int len) 62*0Sstevel@tonic-gate { 63*0Sstevel@tonic-gate char *buf = xmalloc(2*len); 64*0Sstevel@tonic-gate int i, n; 65*0Sstevel@tonic-gate 66*0Sstevel@tonic-gate n = uuencode(data, len, buf, 2*len); 67*0Sstevel@tonic-gate for (i = 0; i < n; i++) { 68*0Sstevel@tonic-gate fprintf(fp, "%c", buf[i]); 69*0Sstevel@tonic-gate if (i % 70 == 69) 70*0Sstevel@tonic-gate fprintf(fp, "\n"); 71*0Sstevel@tonic-gate } 72*0Sstevel@tonic-gate if (i % 70 != 69) 73*0Sstevel@tonic-gate fprintf(fp, "\n"); 74*0Sstevel@tonic-gate xfree(buf); 75*0Sstevel@tonic-gate } 76