base64.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425
  1. /* base64.c -- Encode binary data using printable characters.
  2. Copyright (C) 1999, 2000, 2001, 2004, 2005, 2006 Free Software
  3. Foundation, Inc.
  4. This program is free software; you can redistribute it and/or modify
  5. it under the terms of the GNU General Public License as published by
  6. the Free Software Foundation; either version 3, or (at your option)
  7. any later version.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU General Public License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with this program; if not, write to the Free Software Foundation,
  14. Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
  15. /* Written by Simon Josefsson. Partially adapted from GNU MailUtils
  16. * (mailbox/filter_trans.c, as of 2004-11-28). Improved by review
  17. * from Paul Eggert, Bruno Haible, and Stepan Kasal.
  18. *
  19. * See also RFC 3548 <http://www.ietf.org/rfc/rfc3548.txt>.
  20. *
  21. * Be careful with error checking. Here is how you would typically
  22. * use these functions:
  23. *
  24. * bool ok = base64_decode_alloc (in, inlen, &out, &outlen);
  25. * if (!ok)
  26. * FAIL: input was not valid base64
  27. * if (out == NULL)
  28. * FAIL: memory allocation error
  29. * OK: data in OUT/OUTLEN
  30. *
  31. * size_t outlen = base64_encode_alloc (in, inlen, &out);
  32. * if (out == NULL && outlen == 0 && inlen != 0)
  33. * FAIL: input too long
  34. * if (out == NULL)
  35. * FAIL: memory allocation error
  36. * OK: data in OUT/OUTLEN.
  37. *
  38. */
  39. #include <config.h>
  40. /* Get prototype. */
  41. #include "base64.h"
  42. /* Get malloc. */
  43. #include <stdlib.h>
  44. /* Get UCHAR_MAX. */
  45. #include <limits.h>
  46. /* C89 compliant way to cast 'char' to 'unsigned char'. */
  47. static inline unsigned char
  48. to_uchar (char ch)
  49. {
  50. return ch;
  51. }
  52. /* Base64 encode IN array of size INLEN into OUT array of size OUTLEN.
  53. If OUTLEN is less than BASE64_LENGTH(INLEN), write as many bytes as
  54. possible. If OUTLEN is larger than BASE64_LENGTH(INLEN), also zero
  55. terminate the output buffer. */
  56. void
  57. base64_encode (const char *restrict in, size_t inlen,
  58. char *restrict out, size_t outlen)
  59. {
  60. static const char b64str[64] =
  61. "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
  62. while (inlen && outlen)
  63. {
  64. *out++ = b64str[(to_uchar (in[0]) >> 2) & 0x3f];
  65. if (!--outlen)
  66. break;
  67. *out++ = b64str[((to_uchar (in[0]) << 4)
  68. + (--inlen ? to_uchar (in[1]) >> 4 : 0))
  69. & 0x3f];
  70. if (!--outlen)
  71. break;
  72. *out++ =
  73. (inlen
  74. ? b64str[((to_uchar (in[1]) << 2)
  75. + (--inlen ? to_uchar (in[2]) >> 6 : 0))
  76. & 0x3f]
  77. : '=');
  78. if (!--outlen)
  79. break;
  80. *out++ = inlen ? b64str[to_uchar (in[2]) & 0x3f] : '=';
  81. if (!--outlen)
  82. break;
  83. if (inlen)
  84. inlen--;
  85. if (inlen)
  86. in += 3;
  87. }
  88. if (outlen)
  89. *out = '\0';
  90. }
  91. /* Allocate a buffer and store zero terminated base64 encoded data
  92. from array IN of size INLEN, returning BASE64_LENGTH(INLEN), i.e.,
  93. the length of the encoded data, excluding the terminating zero. On
  94. return, the OUT variable will hold a pointer to newly allocated
  95. memory that must be deallocated by the caller. If output string
  96. length would overflow, 0 is returned and OUT is set to NULL. If
  97. memory allocation failed, OUT is set to NULL, and the return value
  98. indicates length of the requested memory block, i.e.,
  99. BASE64_LENGTH(inlen) + 1. */
  100. size_t
  101. base64_encode_alloc (const char *in, size_t inlen, char **out)
  102. {
  103. size_t outlen = 1 + BASE64_LENGTH (inlen);
  104. /* Check for overflow in outlen computation.
  105. *
  106. * If there is no overflow, outlen >= inlen.
  107. *
  108. * If the operation (inlen + 2) overflows then it yields at most +1, so
  109. * outlen is 0.
  110. *
  111. * If the multiplication overflows, we lose at least half of the
  112. * correct value, so the result is < ((inlen + 2) / 3) * 2, which is
  113. * less than (inlen + 2) * 0.66667, which is less than inlen as soon as
  114. * (inlen > 4).
  115. */
  116. if (inlen > outlen)
  117. {
  118. *out = NULL;
  119. return 0;
  120. }
  121. *out = malloc (outlen);
  122. if (!*out)
  123. return outlen;
  124. base64_encode (in, inlen, *out, outlen);
  125. return outlen - 1;
  126. }
  127. /* With this approach this file works independent of the charset used
  128. (think EBCDIC). However, it does assume that the characters in the
  129. Base64 alphabet (A-Za-z0-9+/) are encoded in 0..255. POSIX
  130. 1003.1-2001 require that char and unsigned char are 8-bit
  131. quantities, though, taking care of that problem. But this may be a
  132. potential problem on non-POSIX C99 platforms.
  133. IBM C V6 for AIX mishandles "#define B64(x) ...'x'...", so use "_"
  134. as the formal parameter rather than "x". */
  135. #define B64(_) \
  136. ((_) == 'A' ? 0 \
  137. : (_) == 'B' ? 1 \
  138. : (_) == 'C' ? 2 \
  139. : (_) == 'D' ? 3 \
  140. : (_) == 'E' ? 4 \
  141. : (_) == 'F' ? 5 \
  142. : (_) == 'G' ? 6 \
  143. : (_) == 'H' ? 7 \
  144. : (_) == 'I' ? 8 \
  145. : (_) == 'J' ? 9 \
  146. : (_) == 'K' ? 10 \
  147. : (_) == 'L' ? 11 \
  148. : (_) == 'M' ? 12 \
  149. : (_) == 'N' ? 13 \
  150. : (_) == 'O' ? 14 \
  151. : (_) == 'P' ? 15 \
  152. : (_) == 'Q' ? 16 \
  153. : (_) == 'R' ? 17 \
  154. : (_) == 'S' ? 18 \
  155. : (_) == 'T' ? 19 \
  156. : (_) == 'U' ? 20 \
  157. : (_) == 'V' ? 21 \
  158. : (_) == 'W' ? 22 \
  159. : (_) == 'X' ? 23 \
  160. : (_) == 'Y' ? 24 \
  161. : (_) == 'Z' ? 25 \
  162. : (_) == 'a' ? 26 \
  163. : (_) == 'b' ? 27 \
  164. : (_) == 'c' ? 28 \
  165. : (_) == 'd' ? 29 \
  166. : (_) == 'e' ? 30 \
  167. : (_) == 'f' ? 31 \
  168. : (_) == 'g' ? 32 \
  169. : (_) == 'h' ? 33 \
  170. : (_) == 'i' ? 34 \
  171. : (_) == 'j' ? 35 \
  172. : (_) == 'k' ? 36 \
  173. : (_) == 'l' ? 37 \
  174. : (_) == 'm' ? 38 \
  175. : (_) == 'n' ? 39 \
  176. : (_) == 'o' ? 40 \
  177. : (_) == 'p' ? 41 \
  178. : (_) == 'q' ? 42 \
  179. : (_) == 'r' ? 43 \
  180. : (_) == 's' ? 44 \
  181. : (_) == 't' ? 45 \
  182. : (_) == 'u' ? 46 \
  183. : (_) == 'v' ? 47 \
  184. : (_) == 'w' ? 48 \
  185. : (_) == 'x' ? 49 \
  186. : (_) == 'y' ? 50 \
  187. : (_) == 'z' ? 51 \
  188. : (_) == '0' ? 52 \
  189. : (_) == '1' ? 53 \
  190. : (_) == '2' ? 54 \
  191. : (_) == '3' ? 55 \
  192. : (_) == '4' ? 56 \
  193. : (_) == '5' ? 57 \
  194. : (_) == '6' ? 58 \
  195. : (_) == '7' ? 59 \
  196. : (_) == '8' ? 60 \
  197. : (_) == '9' ? 61 \
  198. : (_) == '+' ? 62 \
  199. : (_) == '/' ? 63 \
  200. : -1)
  201. static const signed char b64[0x100] = {
  202. B64 (0), B64 (1), B64 (2), B64 (3),
  203. B64 (4), B64 (5), B64 (6), B64 (7),
  204. B64 (8), B64 (9), B64 (10), B64 (11),
  205. B64 (12), B64 (13), B64 (14), B64 (15),
  206. B64 (16), B64 (17), B64 (18), B64 (19),
  207. B64 (20), B64 (21), B64 (22), B64 (23),
  208. B64 (24), B64 (25), B64 (26), B64 (27),
  209. B64 (28), B64 (29), B64 (30), B64 (31),
  210. B64 (32), B64 (33), B64 (34), B64 (35),
  211. B64 (36), B64 (37), B64 (38), B64 (39),
  212. B64 (40), B64 (41), B64 (42), B64 (43),
  213. B64 (44), B64 (45), B64 (46), B64 (47),
  214. B64 (48), B64 (49), B64 (50), B64 (51),
  215. B64 (52), B64 (53), B64 (54), B64 (55),
  216. B64 (56), B64 (57), B64 (58), B64 (59),
  217. B64 (60), B64 (61), B64 (62), B64 (63),
  218. B64 (64), B64 (65), B64 (66), B64 (67),
  219. B64 (68), B64 (69), B64 (70), B64 (71),
  220. B64 (72), B64 (73), B64 (74), B64 (75),
  221. B64 (76), B64 (77), B64 (78), B64 (79),
  222. B64 (80), B64 (81), B64 (82), B64 (83),
  223. B64 (84), B64 (85), B64 (86), B64 (87),
  224. B64 (88), B64 (89), B64 (90), B64 (91),
  225. B64 (92), B64 (93), B64 (94), B64 (95),
  226. B64 (96), B64 (97), B64 (98), B64 (99),
  227. B64 (100), B64 (101), B64 (102), B64 (103),
  228. B64 (104), B64 (105), B64 (106), B64 (107),
  229. B64 (108), B64 (109), B64 (110), B64 (111),
  230. B64 (112), B64 (113), B64 (114), B64 (115),
  231. B64 (116), B64 (117), B64 (118), B64 (119),
  232. B64 (120), B64 (121), B64 (122), B64 (123),
  233. B64 (124), B64 (125), B64 (126), B64 (127),
  234. B64 (128), B64 (129), B64 (130), B64 (131),
  235. B64 (132), B64 (133), B64 (134), B64 (135),
  236. B64 (136), B64 (137), B64 (138), B64 (139),
  237. B64 (140), B64 (141), B64 (142), B64 (143),
  238. B64 (144), B64 (145), B64 (146), B64 (147),
  239. B64 (148), B64 (149), B64 (150), B64 (151),
  240. B64 (152), B64 (153), B64 (154), B64 (155),
  241. B64 (156), B64 (157), B64 (158), B64 (159),
  242. B64 (160), B64 (161), B64 (162), B64 (163),
  243. B64 (164), B64 (165), B64 (166), B64 (167),
  244. B64 (168), B64 (169), B64 (170), B64 (171),
  245. B64 (172), B64 (173), B64 (174), B64 (175),
  246. B64 (176), B64 (177), B64 (178), B64 (179),
  247. B64 (180), B64 (181), B64 (182), B64 (183),
  248. B64 (184), B64 (185), B64 (186), B64 (187),
  249. B64 (188), B64 (189), B64 (190), B64 (191),
  250. B64 (192), B64 (193), B64 (194), B64 (195),
  251. B64 (196), B64 (197), B64 (198), B64 (199),
  252. B64 (200), B64 (201), B64 (202), B64 (203),
  253. B64 (204), B64 (205), B64 (206), B64 (207),
  254. B64 (208), B64 (209), B64 (210), B64 (211),
  255. B64 (212), B64 (213), B64 (214), B64 (215),
  256. B64 (216), B64 (217), B64 (218), B64 (219),
  257. B64 (220), B64 (221), B64 (222), B64 (223),
  258. B64 (224), B64 (225), B64 (226), B64 (227),
  259. B64 (228), B64 (229), B64 (230), B64 (231),
  260. B64 (232), B64 (233), B64 (234), B64 (235),
  261. B64 (236), B64 (237), B64 (238), B64 (239),
  262. B64 (240), B64 (241), B64 (242), B64 (243),
  263. B64 (244), B64 (245), B64 (246), B64 (247),
  264. B64 (248), B64 (249), B64 (250), B64 (251),
  265. B64 (252), B64 (253), B64 (254), B64 (255)
  266. };
  267. #if UCHAR_MAX == 255
  268. # define uchar_in_range(c) true
  269. #else
  270. # define uchar_in_range(c) ((c) <= 255)
  271. #endif
  272. /* Return true if CH is a character from the Base64 alphabet, and
  273. false otherwise. Note that '=' is padding and not considered to be
  274. part of the alphabet. */
  275. bool
  276. isbase64 (char ch)
  277. {
  278. return uchar_in_range (to_uchar (ch)) && 0 <= b64[to_uchar (ch)];
  279. }
  280. /* Decode base64 encoded input array IN of length INLEN to output
  281. array OUT that can hold *OUTLEN bytes. Return true if decoding was
  282. successful, i.e. if the input was valid base64 data, false
  283. otherwise. If *OUTLEN is too small, as many bytes as possible will
  284. be written to OUT. On return, *OUTLEN holds the length of decoded
  285. bytes in OUT. Note that as soon as any non-alphabet characters are
  286. encountered, decoding is stopped and false is returned. This means
  287. that, when applicable, you must remove any line terminators that is
  288. part of the data stream before calling this function. */
  289. bool
  290. base64_decode (const char *restrict in, size_t inlen,
  291. char *restrict out, size_t *outlen)
  292. {
  293. size_t outleft = *outlen;
  294. while (inlen >= 2)
  295. {
  296. if (!isbase64 (in[0]) || !isbase64 (in[1]))
  297. break;
  298. if (outleft)
  299. {
  300. *out++ = ((b64[to_uchar (in[0])] << 2)
  301. | (b64[to_uchar (in[1])] >> 4));
  302. outleft--;
  303. }
  304. if (inlen == 2)
  305. break;
  306. if (in[2] == '=')
  307. {
  308. if (inlen != 4)
  309. break;
  310. if (in[3] != '=')
  311. break;
  312. }
  313. else
  314. {
  315. if (!isbase64 (in[2]))
  316. break;
  317. if (outleft)
  318. {
  319. *out++ = (((b64[to_uchar (in[1])] << 4) & 0xf0)
  320. | (b64[to_uchar (in[2])] >> 2));
  321. outleft--;
  322. }
  323. if (inlen == 3)
  324. break;
  325. if (in[3] == '=')
  326. {
  327. if (inlen != 4)
  328. break;
  329. }
  330. else
  331. {
  332. if (!isbase64 (in[3]))
  333. break;
  334. if (outleft)
  335. {
  336. *out++ = (((b64[to_uchar (in[2])] << 6) & 0xc0)
  337. | b64[to_uchar (in[3])]);
  338. outleft--;
  339. }
  340. }
  341. }
  342. in += 4;
  343. inlen -= 4;
  344. }
  345. *outlen -= outleft;
  346. if (inlen != 0)
  347. return false;
  348. return true;
  349. }
  350. /* Allocate an output buffer in *OUT, and decode the base64 encoded
  351. data stored in IN of size INLEN to the *OUT buffer. On return, the
  352. size of the decoded data is stored in *OUTLEN. OUTLEN may be NULL,
  353. if the caller is not interested in the decoded length. *OUT may be
  354. NULL to indicate an out of memory error, in which case *OUTLEN
  355. contains the size of the memory block needed. The function returns
  356. true on successful decoding and memory allocation errors. (Use the
  357. *OUT and *OUTLEN parameters to differentiate between successful
  358. decoding and memory error.) The function returns false if the
  359. input was invalid, in which case *OUT is NULL and *OUTLEN is
  360. undefined. */
  361. bool
  362. base64_decode_alloc (const char *in, size_t inlen, char **out,
  363. size_t *outlen)
  364. {
  365. /* This may allocate a few bytes too much, depending on input,
  366. but it's not worth the extra CPU time to compute the exact amount.
  367. The exact amount is 3 * inlen / 4, minus 1 if the input ends
  368. with "=" and minus another 1 if the input ends with "==".
  369. Dividing before multiplying avoids the possibility of overflow. */
  370. size_t needlen = 3 * (inlen / 4) + 2;
  371. *out = malloc (needlen);
  372. if (!*out)
  373. return true;
  374. if (!base64_decode (in, inlen, *out, &needlen))
  375. {
  376. free (*out);
  377. *out = NULL;
  378. return false;
  379. }
  380. if (outlen)
  381. *outlen = needlen;
  382. return true;
  383. }