2 * Heirloom mailx - a mail user agent derived from Berkeley Mail.
4 * Copyright (c) 2000-2004 Gunnar Ritter, Freiburg i. Br., Germany.
7 * These base64 routines are derived from the metamail-2.7 sources which
8 * state the following copyright notice:
10 * Copyright (c) 1991 Bell Communications Research, Inc. (Bellcore)
12 * Permission to use, copy, modify, and distribute this material
13 * for any purpose and without fee is hereby granted, provided
14 * that the above copyright notice and this permission notice
15 * appear in all copies, and that the name of Bellcore not be
16 * used in advertising or publicity pertaining to this
17 * material without the specific, prior written permission
18 * of an authorized representative of Bellcore. BELLCORE
19 * MAKES NO REPRESENTATIONS ABOUT THE ACCURACY OR SUITABILITY
20 * OF THIS MATERIAL FOR ANY PURPOSE. IT IS PROVIDED "AS IS",
21 * WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES.
26 static char sccsid
[] = "@(#)base64.c 2.14 (gritter) 4/21/06";
31 * Mail -- a mail program
39 static const char b64table
[] =
40 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
41 static const signed char b64index
[] = {
42 -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1,
43 -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1,
44 -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,62, -1,-1,-1,63,
45 52,53,54,55, 56,57,58,59, 60,61,-1,-1, -1,-1,-1,-1,
46 -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11,12,13,14,
47 15,16,17,18, 19,20,21,22, 23,24,25,-1, -1,-1,-1,-1,
48 -1,26,27,28, 29,30,31,32, 33,34,35,36, 37,38,39,40,
49 41,42,43,44, 45,46,47,48, 49,50,51,-1, -1,-1,-1,-1
52 #define char64(c) ((c) < 0 ? -1 : b64index[(int)(c)])
54 static signed char *ctob64(unsigned char *p
, int pad
);
57 * Convert three characters to base64.
60 ctob64(unsigned char *p
, int pad
)
62 static signed char b64
[4];
64 b64
[0] = b64table
[p
[0] >> 2];
65 b64
[1] = b64table
[((p
[0] & 0x3) << 4) | ((p
[1] & 0xF0) >> 4)];
67 b64
[1] = b64table
[(p
[0] & 0x3) << 4];
68 b64
[2] = b64
[3] = '=';
69 } else if (pad
== 1) {
70 b64
[2] = b64table
[((p
[1] & 0xF) << 2)];
73 b64
[2] = b64table
[((p
[1] & 0xF) << 2) | ((p
[2] & 0xC0) >> 6)];
74 b64
[3] = b64table
[p
[2] & 0x3F];
80 strtob64(const char *p
)
82 return memtob64(p
, strlen(p
));
86 memtob64(const void *vp
, size_t isz
)
92 int i
, l
= 0, sz
= 0, pads
;
101 for (pads
= 2, i
= 0; i
<= 2; i
++, pads
--) {
106 h
= ctob64((unsigned char *)q
, pads
);
108 rs
= srealloc(rs
, sz
= l
+ 100);
109 for (i
= 0; i
< 4; i
++)
117 * Write to a file converting to base64. The input must be aligned
118 * e.g. at 972 character bounds.
121 mime_write_tob64(struct str
*in
, FILE *fo
, int is_header
)
123 char *p
, *upper
, q
[3];
129 upper
= in
->s
+ in
->l
;
130 for (p
= in
->s
, l
= 0; p
< upper
; ) {
131 for (pads
= 2, i
= 0; i
<= 2; i
++, pads
--) {
136 h
= ctob64((unsigned char *)q
, pads
);
137 fwrite(h
, sizeof(char), 4, fo
);
140 putc('\n', fo
), sz
++;
144 if (l
!= 0 && !is_header
) {
145 putc('\n', fo
), sz
++;
151 * Decode from base64.
154 mime_fromb64(struct str
*in
, struct str
*out
, int is_text
)
157 signed char c
, d
, e
, f
, g
;
158 int done
= 0, newline
= 0;
160 out
->s
= smalloc(in
->l
* 3 / 4 + 2);
162 upper
= in
->s
+ in
->l
;
163 for (p
= in
->s
, q
= out
->s
; p
< upper
; ) {
164 while (c
= *p
++, whitechar(c
));
165 if (p
>= upper
) break;
167 while (d
= *p
++, whitechar(d
));
168 if (p
>= upper
) break;
169 while (e
= *p
++, whitechar(e
));
170 if (p
>= upper
) break;
171 while (f
= *p
++, whitechar(f
));
172 if (c
== '=' || d
== '=') {
178 g
= ((c
<< 2) | ((d
& 0x30) >> 4));
182 } else if (g
== '\n' && newline
) {
196 g
= (((d
& 0xF) << 4) | ((e
& 0x3C) >> 2));
200 } else if (g
== '\n' && newline
) {
214 g
= (((e
& 0x03) << 6) | f
);
218 } else if (g
== '\n' && newline
) {
235 * Buffer the base64 input so mime_fromb64 gets always multiples of
237 * As we have only one buffer, this function is not reentrant.
240 mime_fromb64_b(struct str
*in
, struct str
*out
, int is_text
, FILE *f
)
242 static signed char b
[4];
244 static FILE *f_b
= (FILE *)-1;
249 nin
.s
= smalloc(in
->l
+ n
);
250 if (n
!= 0 && f_b
== f
) {
251 for (nin
.l
= 0; nin
.l
< n
; nin
.l
++)
252 nin
.s
[nin
.l
] = b
[nin
.l
];
258 for (i
= 0; i
<= in
->l
; i
++) {
260 if (char64(c
) == -1 && c
!= '=')
262 b
[n
] = nin
.s
[nin
.l
++] = c
;
269 mime_fromb64(&nin
, out
, is_text
);