• base64.c


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

  • 相关阅读:
    JDK1.8新特性
    怎么样深入学习一门技术(Python)
    关于MATLAB R2022b中MATLAB function没有edit data选项的解决办法
    Qt项目移植到mac上一些问题汇总
    10、Kubernetes核心技术 - Label标签
    MySQL要不要容器化?能不能运行在Docker?
    封装一个高级查询组件
    类android设备reset过程
    鸿鹄工程项目管理系统em Spring Cloud+Spring Boot+前后端分离构建工程项目管理系统
    Java自增和自减运算符(++和--)
  • 原文地址:https://blog.csdn.net/Edidaughter/article/details/125516732