base64.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576
  1. /* base64.c -- Encode binary data using printable characters.
  2. Copyright (C) 1999, 2000, 2001, 2004, 2005, 2006, 2009, 2010 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. #include <string.h>
  47. /* C89 compliant way to cast 'char' to 'unsigned char'. */
  48. static inline unsigned char
  49. to_uchar (char ch)
  50. {
  51. return ch;
  52. }
  53. /* Base64 encode IN array of size INLEN into OUT array of size OUTLEN.
  54. If OUTLEN is less than BASE64_LENGTH(INLEN), write as many bytes as
  55. possible. If OUTLEN is larger than BASE64_LENGTH(INLEN), also zero
  56. terminate the output buffer. */
  57. void
  58. base64_encode (const char *restrict in, size_t inlen,
  59. char *restrict out, size_t outlen)
  60. {
  61. static const char b64str[64] =
  62. "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
  63. while (inlen && outlen)
  64. {
  65. *out++ = b64str[(to_uchar (in[0]) >> 2) & 0x3f];
  66. if (!--outlen)
  67. break;
  68. *out++ = b64str[((to_uchar (in[0]) << 4)
  69. + (--inlen ? to_uchar (in[1]) >> 4 : 0))
  70. & 0x3f];
  71. if (!--outlen)
  72. break;
  73. *out++ =
  74. (inlen
  75. ? b64str[((to_uchar (in[1]) << 2)
  76. + (--inlen ? to_uchar (in[2]) >> 6 : 0))
  77. & 0x3f]
  78. : '=');
  79. if (!--outlen)
  80. break;
  81. *out++ = inlen ? b64str[to_uchar (in[2]) & 0x3f] : '=';
  82. if (!--outlen)
  83. break;
  84. if (inlen)
  85. inlen--;
  86. if (inlen)
  87. in += 3;
  88. }
  89. if (outlen)
  90. *out = '\0';
  91. }
  92. /* Allocate a buffer and store zero terminated base64 encoded data
  93. from array IN of size INLEN, returning BASE64_LENGTH(INLEN), i.e.,
  94. the length of the encoded data, excluding the terminating zero. On
  95. return, the OUT variable will hold a pointer to newly allocated
  96. memory that must be deallocated by the caller. If output string
  97. length would overflow, 0 is returned and OUT is set to NULL. If
  98. memory allocation failed, OUT is set to NULL, and the return value
  99. indicates length of the requested memory block, i.e.,
  100. BASE64_LENGTH(inlen) + 1. */
  101. size_t
  102. base64_encode_alloc (const char *in, size_t inlen, char **out)
  103. {
  104. size_t outlen = 1 + BASE64_LENGTH (inlen);
  105. /* Check for overflow in outlen computation.
  106. *
  107. * If there is no overflow, outlen >= inlen.
  108. *
  109. * If the operation (inlen + 2) overflows then it yields at most +1, so
  110. * outlen is 0.
  111. *
  112. * If the multiplication overflows, we lose at least half of the
  113. * correct value, so the result is < ((inlen + 2) / 3) * 2, which is
  114. * less than (inlen + 2) * 0.66667, which is less than inlen as soon as
  115. * (inlen > 4).
  116. */
  117. if (inlen > outlen)
  118. {
  119. *out = NULL;
  120. return 0;
  121. }
  122. *out = malloc (outlen);
  123. if (!*out)
  124. return outlen;
  125. base64_encode (in, inlen, *out, outlen);
  126. return outlen - 1;
  127. }
  128. /* With this approach this file works independent of the charset used
  129. (think EBCDIC). However, it does assume that the characters in the
  130. Base64 alphabet (A-Za-z0-9+/) are encoded in 0..255. POSIX
  131. 1003.1-2001 require that char and unsigned char are 8-bit
  132. quantities, though, taking care of that problem. But this may be a
  133. potential problem on non-POSIX C99 platforms.
  134. IBM C V6 for AIX mishandles "#define B64(x) ...'x'...", so use "_"
  135. as the formal parameter rather than "x". */
  136. #define B64(_) \
  137. ((_) == 'A' ? 0 \
  138. : (_) == 'B' ? 1 \
  139. : (_) == 'C' ? 2 \
  140. : (_) == 'D' ? 3 \
  141. : (_) == 'E' ? 4 \
  142. : (_) == 'F' ? 5 \
  143. : (_) == 'G' ? 6 \
  144. : (_) == 'H' ? 7 \
  145. : (_) == 'I' ? 8 \
  146. : (_) == 'J' ? 9 \
  147. : (_) == 'K' ? 10 \
  148. : (_) == 'L' ? 11 \
  149. : (_) == 'M' ? 12 \
  150. : (_) == 'N' ? 13 \
  151. : (_) == 'O' ? 14 \
  152. : (_) == 'P' ? 15 \
  153. : (_) == 'Q' ? 16 \
  154. : (_) == 'R' ? 17 \
  155. : (_) == 'S' ? 18 \
  156. : (_) == 'T' ? 19 \
  157. : (_) == 'U' ? 20 \
  158. : (_) == 'V' ? 21 \
  159. : (_) == 'W' ? 22 \
  160. : (_) == 'X' ? 23 \
  161. : (_) == 'Y' ? 24 \
  162. : (_) == 'Z' ? 25 \
  163. : (_) == 'a' ? 26 \
  164. : (_) == 'b' ? 27 \
  165. : (_) == 'c' ? 28 \
  166. : (_) == 'd' ? 29 \
  167. : (_) == 'e' ? 30 \
  168. : (_) == 'f' ? 31 \
  169. : (_) == 'g' ? 32 \
  170. : (_) == 'h' ? 33 \
  171. : (_) == 'i' ? 34 \
  172. : (_) == 'j' ? 35 \
  173. : (_) == 'k' ? 36 \
  174. : (_) == 'l' ? 37 \
  175. : (_) == 'm' ? 38 \
  176. : (_) == 'n' ? 39 \
  177. : (_) == 'o' ? 40 \
  178. : (_) == 'p' ? 41 \
  179. : (_) == 'q' ? 42 \
  180. : (_) == 'r' ? 43 \
  181. : (_) == 's' ? 44 \
  182. : (_) == 't' ? 45 \
  183. : (_) == 'u' ? 46 \
  184. : (_) == 'v' ? 47 \
  185. : (_) == 'w' ? 48 \
  186. : (_) == 'x' ? 49 \
  187. : (_) == 'y' ? 50 \
  188. : (_) == 'z' ? 51 \
  189. : (_) == '0' ? 52 \
  190. : (_) == '1' ? 53 \
  191. : (_) == '2' ? 54 \
  192. : (_) == '3' ? 55 \
  193. : (_) == '4' ? 56 \
  194. : (_) == '5' ? 57 \
  195. : (_) == '6' ? 58 \
  196. : (_) == '7' ? 59 \
  197. : (_) == '8' ? 60 \
  198. : (_) == '9' ? 61 \
  199. : (_) == '+' ? 62 \
  200. : (_) == '/' ? 63 \
  201. : -1)
  202. static const signed char b64[0x100] = {
  203. B64 (0), B64 (1), B64 (2), B64 (3),
  204. B64 (4), B64 (5), B64 (6), B64 (7),
  205. B64 (8), B64 (9), B64 (10), B64 (11),
  206. B64 (12), B64 (13), B64 (14), B64 (15),
  207. B64 (16), B64 (17), B64 (18), B64 (19),
  208. B64 (20), B64 (21), B64 (22), B64 (23),
  209. B64 (24), B64 (25), B64 (26), B64 (27),
  210. B64 (28), B64 (29), B64 (30), B64 (31),
  211. B64 (32), B64 (33), B64 (34), B64 (35),
  212. B64 (36), B64 (37), B64 (38), B64 (39),
  213. B64 (40), B64 (41), B64 (42), B64 (43),
  214. B64 (44), B64 (45), B64 (46), B64 (47),
  215. B64 (48), B64 (49), B64 (50), B64 (51),
  216. B64 (52), B64 (53), B64 (54), B64 (55),
  217. B64 (56), B64 (57), B64 (58), B64 (59),
  218. B64 (60), B64 (61), B64 (62), B64 (63),
  219. B64 (64), B64 (65), B64 (66), B64 (67),
  220. B64 (68), B64 (69), B64 (70), B64 (71),
  221. B64 (72), B64 (73), B64 (74), B64 (75),
  222. B64 (76), B64 (77), B64 (78), B64 (79),
  223. B64 (80), B64 (81), B64 (82), B64 (83),
  224. B64 (84), B64 (85), B64 (86), B64 (87),
  225. B64 (88), B64 (89), B64 (90), B64 (91),
  226. B64 (92), B64 (93), B64 (94), B64 (95),
  227. B64 (96), B64 (97), B64 (98), B64 (99),
  228. B64 (100), B64 (101), B64 (102), B64 (103),
  229. B64 (104), B64 (105), B64 (106), B64 (107),
  230. B64 (108), B64 (109), B64 (110), B64 (111),
  231. B64 (112), B64 (113), B64 (114), B64 (115),
  232. B64 (116), B64 (117), B64 (118), B64 (119),
  233. B64 (120), B64 (121), B64 (122), B64 (123),
  234. B64 (124), B64 (125), B64 (126), B64 (127),
  235. B64 (128), B64 (129), B64 (130), B64 (131),
  236. B64 (132), B64 (133), B64 (134), B64 (135),
  237. B64 (136), B64 (137), B64 (138), B64 (139),
  238. B64 (140), B64 (141), B64 (142), B64 (143),
  239. B64 (144), B64 (145), B64 (146), B64 (147),
  240. B64 (148), B64 (149), B64 (150), B64 (151),
  241. B64 (152), B64 (153), B64 (154), B64 (155),
  242. B64 (156), B64 (157), B64 (158), B64 (159),
  243. B64 (160), B64 (161), B64 (162), B64 (163),
  244. B64 (164), B64 (165), B64 (166), B64 (167),
  245. B64 (168), B64 (169), B64 (170), B64 (171),
  246. B64 (172), B64 (173), B64 (174), B64 (175),
  247. B64 (176), B64 (177), B64 (178), B64 (179),
  248. B64 (180), B64 (181), B64 (182), B64 (183),
  249. B64 (184), B64 (185), B64 (186), B64 (187),
  250. B64 (188), B64 (189), B64 (190), B64 (191),
  251. B64 (192), B64 (193), B64 (194), B64 (195),
  252. B64 (196), B64 (197), B64 (198), B64 (199),
  253. B64 (200), B64 (201), B64 (202), B64 (203),
  254. B64 (204), B64 (205), B64 (206), B64 (207),
  255. B64 (208), B64 (209), B64 (210), B64 (211),
  256. B64 (212), B64 (213), B64 (214), B64 (215),
  257. B64 (216), B64 (217), B64 (218), B64 (219),
  258. B64 (220), B64 (221), B64 (222), B64 (223),
  259. B64 (224), B64 (225), B64 (226), B64 (227),
  260. B64 (228), B64 (229), B64 (230), B64 (231),
  261. B64 (232), B64 (233), B64 (234), B64 (235),
  262. B64 (236), B64 (237), B64 (238), B64 (239),
  263. B64 (240), B64 (241), B64 (242), B64 (243),
  264. B64 (244), B64 (245), B64 (246), B64 (247),
  265. B64 (248), B64 (249), B64 (250), B64 (251),
  266. B64 (252), B64 (253), B64 (254), B64 (255)
  267. };
  268. #if UCHAR_MAX == 255
  269. # define uchar_in_range(c) true
  270. #else
  271. # define uchar_in_range(c) ((c) <= 255)
  272. #endif
  273. /* Return true if CH is a character from the Base64 alphabet, and
  274. false otherwise. Note that '=' is padding and not considered to be
  275. part of the alphabet. */
  276. bool
  277. isbase64 (char ch)
  278. {
  279. return uchar_in_range (to_uchar (ch)) && 0 <= b64[to_uchar (ch)];
  280. }
  281. /* Initialize decode-context buffer, CTX. */
  282. void
  283. base64_decode_ctx_init (struct base64_decode_context *ctx)
  284. {
  285. ctx->i = 0;
  286. }
  287. /* If CTX->i is 0 or 4, there are four or more bytes in [*IN..IN_END), and
  288. none of those four is a newline, then return *IN. Otherwise, copy up to
  289. 4 - CTX->i non-newline bytes from that range into CTX->buf, starting at
  290. index CTX->i and setting CTX->i to reflect the number of bytes copied,
  291. and return CTX->buf. In either case, advance *IN to point to the byte
  292. after the last one processed, and set *N_NON_NEWLINE to the number of
  293. verified non-newline bytes accessible through the returned pointer. */
  294. static inline char *
  295. get_4 (struct base64_decode_context *ctx,
  296. char const *restrict *in, char const *restrict in_end,
  297. size_t *n_non_newline)
  298. {
  299. if (ctx->i == 4)
  300. ctx->i = 0;
  301. if (ctx->i == 0)
  302. {
  303. char const *t = *in;
  304. if (4 <= in_end - *in && memchr (t, '\n', 4) == NULL)
  305. {
  306. /* This is the common case: no newline. */
  307. *in += 4;
  308. *n_non_newline = 4;
  309. return (char *) t;
  310. }
  311. }
  312. {
  313. /* Copy non-newline bytes into BUF. */
  314. char const *p = *in;
  315. while (p < in_end)
  316. {
  317. char c = *p++;
  318. if (c != '\n')
  319. {
  320. ctx->buf[ctx->i++] = c;
  321. if (ctx->i == 4)
  322. break;
  323. }
  324. }
  325. *in = p;
  326. *n_non_newline = ctx->i;
  327. return ctx->buf;
  328. }
  329. }
  330. #define return_false \
  331. do \
  332. { \
  333. *outp = out; \
  334. return false; \
  335. } \
  336. while (false)
  337. /* Decode up to four bytes of base64-encoded data, IN, of length INLEN
  338. into the output buffer, *OUT, of size *OUTLEN bytes. Return true if
  339. decoding is successful, false otherwise. If *OUTLEN is too small,
  340. as many bytes as possible are written to *OUT. On return, advance
  341. *OUT to point to the byte after the last one written, and decrement
  342. *OUTLEN to reflect the number of bytes remaining in *OUT. */
  343. static inline bool
  344. decode_4 (char const *restrict in, size_t inlen,
  345. char *restrict *outp, size_t *outleft)
  346. {
  347. char *out = *outp;
  348. if (inlen < 2)
  349. return false;
  350. if (!isbase64 (in[0]) || !isbase64 (in[1]))
  351. return false;
  352. if (*outleft)
  353. {
  354. *out++ = ((b64[to_uchar (in[0])] << 2)
  355. | (b64[to_uchar (in[1])] >> 4));
  356. --*outleft;
  357. }
  358. if (inlen == 2)
  359. return_false;
  360. if (in[2] == '=')
  361. {
  362. if (inlen != 4)
  363. return_false;
  364. if (in[3] != '=')
  365. return_false;
  366. }
  367. else
  368. {
  369. if (!isbase64 (in[2]))
  370. return_false;
  371. if (*outleft)
  372. {
  373. *out++ = (((b64[to_uchar (in[1])] << 4) & 0xf0)
  374. | (b64[to_uchar (in[2])] >> 2));
  375. --*outleft;
  376. }
  377. if (inlen == 3)
  378. return_false;
  379. if (in[3] == '=')
  380. {
  381. if (inlen != 4)
  382. return_false;
  383. }
  384. else
  385. {
  386. if (!isbase64 (in[3]))
  387. return_false;
  388. if (*outleft)
  389. {
  390. *out++ = (((b64[to_uchar (in[2])] << 6) & 0xc0)
  391. | b64[to_uchar (in[3])]);
  392. --*outleft;
  393. }
  394. }
  395. }
  396. *outp = out;
  397. return true;
  398. }
  399. /* Decode base64-encoded input array IN of length INLEN to output array
  400. OUT that can hold *OUTLEN bytes. The input data may be interspersed
  401. with newlines. Return true if decoding was successful, i.e. if the
  402. input was valid base64 data, false otherwise. If *OUTLEN is too
  403. small, as many bytes as possible will be written to OUT. On return,
  404. *OUTLEN holds the length of decoded bytes in OUT. Note that as soon
  405. as any non-alphabet, non-newline character is encountered, decoding
  406. is stopped and false is returned. If INLEN is zero, then process
  407. only whatever data is stored in CTX.
  408. Initially, CTX must have been initialized via base64_decode_ctx_init.
  409. Subsequent calls to this function must reuse whatever state is recorded
  410. in that buffer. It is necessary for when a quadruple of base64 input
  411. bytes spans two input buffers.
  412. If CTX is NULL then newlines are treated as garbage and the input
  413. buffer is processed as a unit. */
  414. bool
  415. base64_decode_ctx (struct base64_decode_context *ctx,
  416. const char *restrict in, size_t inlen,
  417. char *restrict out, size_t *outlen)
  418. {
  419. size_t outleft = *outlen;
  420. bool ignore_newlines = ctx != NULL;
  421. bool flush_ctx = false;
  422. unsigned int ctx_i = 0;
  423. if (ignore_newlines)
  424. {
  425. ctx_i = ctx->i;
  426. flush_ctx = inlen == 0;
  427. }
  428. while (true)
  429. {
  430. size_t outleft_save = outleft;
  431. if (ctx_i == 0 && !flush_ctx)
  432. {
  433. while (true)
  434. {
  435. /* Save a copy of outleft, in case we need to re-parse this
  436. block of four bytes. */
  437. outleft_save = outleft;
  438. if (!decode_4 (in, inlen, &out, &outleft))
  439. break;
  440. in += 4;
  441. inlen -= 4;
  442. }
  443. }
  444. if (inlen == 0 && !flush_ctx)
  445. break;
  446. /* Handle the common case of 72-byte wrapped lines.
  447. This also handles any other multiple-of-4-byte wrapping. */
  448. if (inlen && *in == '\n' && ignore_newlines)
  449. {
  450. ++in;
  451. --inlen;
  452. continue;
  453. }
  454. /* Restore OUT and OUTLEFT. */
  455. out -= outleft_save - outleft;
  456. outleft = outleft_save;
  457. {
  458. char const *in_end = in + inlen;
  459. char const *non_nl;
  460. if (ignore_newlines)
  461. non_nl = get_4 (ctx, &in, in_end, &inlen);
  462. else
  463. non_nl = in; /* Might have nl in this case. */
  464. /* If the input is empty or consists solely of newlines (0 non-newlines),
  465. then we're done. Likewise if there are fewer than 4 bytes when not
  466. flushing context and not treating newlines as garbage. */
  467. if (inlen == 0 || (inlen < 4 && !flush_ctx && ignore_newlines))
  468. {
  469. inlen = 0;
  470. break;
  471. }
  472. if (!decode_4 (non_nl, inlen, &out, &outleft))
  473. break;
  474. inlen = in_end - in;
  475. }
  476. }
  477. *outlen -= outleft;
  478. return inlen == 0;
  479. }
  480. /* Allocate an output buffer in *OUT, and decode the base64 encoded
  481. data stored in IN of size INLEN to the *OUT buffer. On return, the
  482. size of the decoded data is stored in *OUTLEN. OUTLEN may be NULL,
  483. if the caller is not interested in the decoded length. *OUT may be
  484. NULL to indicate an out of memory error, in which case *OUTLEN
  485. contains the size of the memory block needed. The function returns
  486. true on successful decoding and memory allocation errors. (Use the
  487. *OUT and *OUTLEN parameters to differentiate between successful
  488. decoding and memory error.) The function returns false if the
  489. input was invalid, in which case *OUT is NULL and *OUTLEN is
  490. undefined. */
  491. bool
  492. base64_decode_alloc_ctx (struct base64_decode_context *ctx,
  493. const char *in, size_t inlen, char **out,
  494. size_t *outlen)
  495. {
  496. /* This may allocate a few bytes too many, depending on input,
  497. but it's not worth the extra CPU time to compute the exact size.
  498. The exact size is 3 * inlen / 4, minus 1 if the input ends
  499. with "=" and minus another 1 if the input ends with "==".
  500. Dividing before multiplying avoids the possibility of overflow. */
  501. size_t needlen = 3 * (inlen / 4) + 2;
  502. *out = malloc (needlen);
  503. if (!*out)
  504. return true;
  505. if (!base64_decode_ctx (ctx, in, inlen, *out, &needlen))
  506. {
  507. free (*out);
  508. *out = NULL;
  509. return false;
  510. }
  511. if (outlen)
  512. *outlen = needlen;
  513. return true;
  514. }