2 * Sylpheed -- a GTK+ based, lightweight, and fast e-mail client
3 * Copyright (C) 1999,2000 Hiroyuki Yamamoto
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
22 #define UUDECODE(c) (c=='`' ? 0 : c - ' ')
23 #define N64(i) (i & ~63)
25 const char uudigit[64] =
27 '`', '!', '"', '#', '$', '%', '&', '\'',
28 '(', ')', '*', '+', ',', '-', '.', '/',
29 '0', '1', '2', '3', '4', '5', '6', '7',
30 '8', '9', ':', ';', '<', '=', '>', '?',
31 '@', 'A', 'B', 'C', 'D', 'E', 'F', 'G',
32 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O',
33 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W',
34 'X', 'Y', 'Z', '[', '\\', ']', '^', '_'
37 int touufrombits(unsigned char *out, const unsigned char *in, int inlen)
41 if (inlen > 45) return -1;
42 len = (inlen * 4 + 2) / 3 + 1;
43 *out++ = uudigit[inlen];
45 for (; inlen >= 3; inlen -= 3) {
46 *out++ = uudigit[in[0] >> 2];
47 *out++ = uudigit[((in[0] << 4) & 0x30) | (in[1] >> 4)];
48 *out++ = uudigit[((in[1] << 2) & 0x3c) | (in[2] >> 6)];
49 *out++ = uudigit[in[2] & 0x3f];
54 *out++ = uudigit[(in[0] >> 2)];
56 *out++ = uudigit[((in[0] << 4) & 0x30)];
58 *out++ = uudigit[(((in[0] << 4) & 0x30) | (in[1] >> 4))] ;
59 *out++ = uudigit[((in[1] << 2) & 0x3c)];
67 int fromuutobits(char *out, const char *in)
69 int len, outlen, inlen;
70 register unsigned char digit1, digit2;
72 outlen = UUDECODE(in[0]);
74 if(outlen < 0 || outlen > 45)
78 inlen = (outlen * 4 + 2) / 3;
81 for( ; inlen>0; inlen-=4) {
82 digit1 = UUDECODE(in[0]);
83 if (N64(digit1)) return -1;
84 digit2 = UUDECODE(in[1]);
85 if (N64(digit2)) return -1;
86 out[len++] = (digit1 << 2) | (digit2 >> 4);
88 digit1 = UUDECODE(in[2]);
89 if (N64(digit1)) return -1;
90 out[len++] = (digit2 << 4) | (digit1 >> 2);
92 digit2 = UUDECODE(in[3]);
93 if (N64(digit2)) return -1;
94 out[len++] = (digit1 << 6) | digit2;
100 return len == outlen ? len : -3;